Pierre Sutra
ABSTRACT
Atomic broadcast is a group communication primitive to order messages across a set of distributed processes. Atomic multicast is its natural generalization where each message m is addressed to dst (m), a subset of the processes called its destination group. A solution to atomic multicast is genuine when a process takes steps only if a message is addressed to it. Genuine solutions are the ones used in practice because they have better performance.
Supplemental Material
- Kenneth Birman and Thomas A. Joseph. 1987. Reliable Communication in the Presence of Failures. ACM Trans. on Comp. Sys. 5, 1 (1987), 47--76.Google Scholar
Digital Library
- Kenneth Birman, André Schiper, and Pat Stephenson. 1991. Lightweight Causal and Atomic Group Multicast. ACM Trans. on Comp. Sys. 9, 3 (1991), 272--314.Google ScholarDigital Library
- François Bonnet and Michel Raynal. 2010. A simple proof of the necessity of the failure detector Sigma to implement an atomic register in asynchronous message-passing systems. Inform. Process. Lett. 110, 4 (2010), 153--157.Google ScholarDigital Library
- Tushar Deepak Chandra, Vassos Hadzilacos, and Sam Toueg. 1996. The Weakest Failure Detector for Solving Consensus. J. ACM 43, 4 (July 1996), 685--722.Google ScholarDigital Library
- Tushar Deepak Chandra and Sam Toueg. 1996. Unreliable Failure Detectors for Reliable Distributed Systems. J. ACM 43, 2 (1996), 225--267.Google ScholarDigital Library
- Paulo R. Coelho, Nicolas Schiper, and Fernando Pedone. 2017. Fast Atomic Multicast. In Proceedings of the Annual IEEE/IFIP int. conf. on Dependable Sys. and Networks, DSN'17. IEEE Computer Society, 37--48.Google ScholarCross Ref
- James A. Cowling and Barbara Liskov. 2012. Granola: Low-Overhead Distributed Transaction Coordination. In Proceedings of the USENIX Annual Technical Conference, ATC'12. USENIX Association, 223--235.Google Scholar
- Carole Delporte-Gallet and Hugues Fauconnier. 2000. Fault-Tolerant Genuine Atomic Multicast to Multiple Groups. In Proceedings of the International Conference on Principles of Distributed Systems, OPODIS'00 (Studia Informatica Universalis). Suger, 107--122.Google Scholar
- Carole Delporte-Gallet, Hugues Fauconnier, and Rachid Guerraoui. 2002. A Realistic Look At Failure Detectors. In Proceedings of the Annual IEEE/IFIP int. conf. on Dependable Sys. and Networks, DSN'02. IEEE Computer Society, 345--353.Google ScholarCross Ref
- Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Vassos Hadzilacos, Petr Kouznetsov, and Sam Toueg. 2004. The weakest failure detectors to solve certain fundamental problems in distributed computing. In Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC'04. ACM, 338--346.Google ScholarDigital Library
- Vitor Enes, Carlos Baquero, Alexey Gotsman, and Pierre Sutra. 2021. Efficient Replication via Timestamp Stability. In Proceedings of the EuroSys European Conference on Computer Systems, EuroSys'21. ACM, 178--193.Google ScholarDigital Library
- Felix C. Freiling, Rachid Guerraoui, and Petr Kuznetsov. 2011. The Failure Detector Abstraction. ACM Comput. Surv. 43, 2, Article 9 (feb 2011), 40 pages.Google Scholar
- Alexey Gotsman, Anatole Lefort, and Gregory V. Chockler. 2019. White-Box Atomic Multicast. In Proceedings of the Annual IEEE/IFIP int. conf. on Dependable Sys. and Networks, DSN'19. IEEE Computer Society, 176--187.Google Scholar
- Rachid Guerraoui and André Schiper. 2001. Genuine atomic multicast in asynchronous distributed systems. Theo. Computer Science 254, 1--2 (2001), 297--316.Google ScholarDigital Library
- Udo Fritzke Jr., Philippe Ingels, Achour Mostéfaoui, and Michel Raynal. 2001. Consensus-Based Fault-Tolerant Total Order Multicast. IEEE Transactions on Parallel Distributem Systems 12, 2 (2001), 147--156.Google ScholarDigital Library
- Long Hoang Le, Mojtaba Eslahi-Kelorazi, Paulo R. Coelho, and Fernando Pedone. 2021. RamCast: RDMA-based atomic multicast. In Proceedings of the International Middleware Conference, Middleware'21. ACM, 172--184.Google ScholarDigital Library
- Parisa Jalili Marandi, Marco Primi, and Fernando Pedone. 2012. Multi-Ring Paxos. In Proceedings of the Annual IEEE/IFIP int. conf. on Dependable Sys. and Networks, DSN'12. IEEE Computer Society, 1--12.Google Scholar
- Shuai Mu, Lamont Nelson, Wyatt Lloyd, and Jinyang Li. 2016. Consolidating Concurrency Control and Consensus for Commits under Conflicts. In Proceedings of the USENIX Symposium on Operating Systems Design and Implementation, OSDI'16. USENIX Association, 517--532.Google Scholar
- Nicolas Schiper and Fernando Pedone. 2008. Solving Atomic Multicast When Groups Crash. In Proceedings of the International Conference on Principles of Distributed Systems, OPODIS'08 (Lecture Notes in Computer Science), Vol. 5401. Springer, 481--495.Google ScholarDigital Library
- Nicolas Schiper, Pierre Sutra, and Fernando Pedone. 2009. Genuine versus Non- Genuine Atomic Multicast Protocols for Wide Area Networks: An Empirical Study. In Proceedings of the IEEE Symposium on Reliable Distributed Systems, SRDS'09. IEEE Computer Society, 166--175.Google ScholarDigital Library
- Nicolas Schiper, Pierre Sutra, and Fernando Pedone. 2010. P-Store: Genuine Partial Replication in Wide Area Networks. In Proceedings of the IEEE Symposium on Reliable Distributed Systems, SRDS'10. IEEE Computer Society, 214--224.Google ScholarDigital Library
Index Terms
- Brief Announcement: The Weakest Failure Detector for Genuine Atomic Multicast
Recommendations
Brief announcement: single-version permissive STM
PODC '10: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computingWe present a single-version STM that satisfies a practical notion of permissiveness: it never aborts read-only transactions, and it only aborts an update transaction due to another conflicting update transaction, thereby avoiding many spurious aborts. ...
Brief announcement: on enhancing concurrency in distributed transactional memory
PODC '10: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computingDistributed transactional memory (TM) models based on globally-consistent contention management policies may abort many transactions that could potentially commit without violating correctness. To reduce unnecessary aborts and increase concurrency, we ...
Brief Announcement: Proust: A Design Space for Highly-Concurrent Transactional Data Structures
PODC '17: Proceedings of the ACM Symposium on Principles of Distributed ComputingMost STM systems are poorly equipped to support libraries of concurrent data structures. One reason is that they typically detect conflicts by tracking transactions' read sets and write sets, an approach that often leads to false conflicts. A second is ...
Comments