MultiPaxos Made Complete
Zhiying Liang, Vahab Jabrayilov, Aleksey Charapko, Abutalib Aghayev

TL;DR
This paper provides a comprehensive, detailed implementation and analysis of MultiPaxos, addressing previous gaps in guidance, and demonstrating improved performance, stability, and robustness in practical distributed systems.
Contribution
It offers the first complete, step-by-step design, pseudocode, and open-source implementation of MultiPaxos, enhancing its practical utility and correctness.
Findings
Improved performance stability and resource efficiency.
Enhanced leader election and failure detection mechanisms.
Better liveness under network partitions.
Abstract
MultiPaxos, while a fundamental Replicated State Machine algorithm, suffers from a dearth of comprehensive guidelines for achieving a complete and correct implementation. This deficiency has hindered MultiPaxos' practical utility and adoption and has resulted in flawed claims about its capabilities. Our paper aims to bridge the gap between MultiPaxos' complexity and practical implementation through a meticulous and detailed design process spanning more than a year. It carefully dissects each phase of MultiPaxos and offers detailed step-by-step pseudocode -- in addition to a complete open-source implementation -- for all components, including the leader election, the failure detector, and the commit phase. The implementation of our complete design also provides better performance stability, resource usage, and network partition tolerance than naive MultiPaxos versions. Our…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSoftware System Performance and Reliability · Parallel Computing and Optimization Techniques · Cloud Computing and Resource Management
