Genuine atomic multicast

  • Rachid Guerraoui
  • André Schiper
Contributed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1320)


This paper addresses the problem of atomic multicasting messages in asynchronous systems with unreliable failure detection. First, we give a characterisation of the notion of algorithms tolerating unreliable failure detection. Second, we give a characterisation of the notion of genuine atomic multicast. This characterisation leads to a better understanding of the difference between atomic multicast and atomic broadcast, and to a clear distinction between genuine atomic multicast algorithms and non-genuine atomic multicast algorithms. Third, we show that in a system with at least three processes, the genuine atomic multicast problem cannot be solved with unreliable failure detection, if at least one process may crash. We mention however two ways of circumventing this impossibility result.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    T. Chandra and S. Toueg. Unreliable failure detectors for reliable distributed systems. Journal of the ACM, 43(2), pages 225–267, 1996.CrossRefGoogle Scholar
  2. 2.
    H. Garcia Molina and A. Spauster. Ordered and Reliable Multicast Communication. ACM Transactions on Computer Systems, 9(3), pages 242–271, August 1991.CrossRefGoogle Scholar
  3. 3.
    R. Guerraoui and A. Schiper. Total Order Multicast to Multiple Groups. Proceedings of the 7th IEEE Int. Conf. on Distributed Computing Systems, Baltimore, pages: 578–585, May 1997.Google Scholar
  4. 4.
    V. Hadzilacos and S. Toueg. Fault-Tolerant Broadcasts and Related Problems. In Distributed Systems, Sape Mullender Editor, ACM Press Publisher, pages 97–145, 1993.Google Scholar
  5. 5.
    X. Jia. A Total Ordering Multicast Protocol Using Propagation Trees. IEEE Transactions on Parallel and Distributed Systems, 6(6), pages 617–627, June 1995.CrossRefGoogle Scholar
  6. 6.
    L. Lamport. Time, Clocks, and the Ordering of Events in a Distributed System. Communications of the ACM, 21(7), pages 558–565, July 1978.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Rachid Guerraoui
    • 1
  • André Schiper
    • 1
  1. 1.Département d'InformatiqueEcole Polytechnique Fédérale de LausanneLausanneSwitzerland

Personalised recommendations