Generalize Synchronization Mechanism: Specification, Properties, Limits (2309.11972v2)
Abstract: Shared resources synchronization is a well studied problem, in both shared memory environment or distributed memory environment. Many synchronization mechanisms are proposed, with their own way to reach certain consistency level. This thesis further found that there is no perfect synchronization mechanism. Each of them has its properties at different level. For example, to enforce strong consistency, writers may loose writing freedom or it would take more time to coordinate. This thesis proposes a framework to generalize all synchronization mechanism in a formal way for better reasoning on properties, from the perspective of multi-writer to single-writer convergence. Therefore, limitations prevent a synchronization mechanism from achieving every property at its optimal level. CAP and ROLL were proposed in previous works to explain such. CAP theorem states that it can only achieve two of Consistency, Availability and Partition tolerance properties. ROLL Theorem uses a framework to model leaderless SMR protocol and states quorum size and fault tolerance are trading off. The thesis covers five properties in a more understandable way to analyze trade-offs and explore new mechanisms.
- Spanner: Google’s globally distributed database. ACM Trans. Comput. Syst., 31(3), aug 2013. doi:10.1145/2491245.
- Impossibility of distributed consensus with one faulty process. J. ACM, 32(2):374–382, apr 1985. doi:10.1145/3149.214121.
- ISO. ISO/IEC 9899:2011: Programming Languages — C. December 2011. Available in electronic form for online purchase at =https://www.iso.org/standard/74528.html=. URL: https://www.open-std.org/JTC1/SC22/WG14/www/docs/n1570.pdf;https://www.iso.org/standard/74528.html;.
- Leslie Lamport. Time, clocks, and the ordering of events in a distributed system. Commun. ACM, 21(7):558–565, jul 1978. doi:10.1145/359545.359563.
- Leslie Lamport. The part-time parliament. ACM Trans. Comput. Syst., 16(2):133–169, may 1998. doi:10.1145/279227.279229.
- Leslie Lamport. Generalized consensus and paxos. 2005.
- There is more consensus in egalitarian parliaments. In Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles, SOSP ’13, page 358–372, New York, NY, USA, 2013. Association for Computing Machinery. doi:10.1145/2517349.2517350.
- Viewstamped replication: A new primary copy method to support highly-available distributed systems. In Proceedings of the Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC ’88, page 8–17, New York, NY, USA, 1988. Association for Computing Machinery. doi:10.1145/62546.62549.
- In search of an understandable consensus algorithm. In 2014 USENIX Annual Technical Conference (USENIX ATC 14), pages 305–319, Philadelphia, PA, June 2014. USENIX Association. URL: https://www.usenix.org/conference/atc14/technical-sessions/presentation/ongaro.
- Leaderless state-machine replication: Specification, properties, limits (extended version), 2020. arXiv:2008.02512.
- Conflict-free replicated data types. In Xavier Défago, Franck Petit, and Vincent Villain, editors, Stabilization, Safety, and Security of Distributed Systems, pages 386–400, Berlin, Heidelberg, 2011. Springer Berlin Heidelberg.
- EPaxos revisited. In 18th USENIX Symposium on Networked Systems Design and Implementation (NSDI 21), pages 613–632. USENIX Association, April 2021. URL: https://www.usenix.org/conference/nsdi21/presentation/tollman.
- Consistency in non-transactional distributed storage systems. ACM Comput. Surv., 49(1), jun 2016. doi:10.1145/2926965.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.