Low-latency Atomic Broadcast in the presence of contention

  • Piotr Zieliński
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4167)


The Atomic Broadcast algorithm described in this paper can deliver messages in two communication steps, even if multiple processes broadcast at the same time. It tags all broadcast messages with the local real time, and delivers all messages in order of these timestamps. The Ω-elected leader simulates processes it suspects to have crashed (⋄S). For fault-tolerance, it uses a new cheap Generic Broadcast algorithm that requires only a majority of correct processes (n > 2f) and, in failure-free runs, delivers all non-conflicting messages in two steps. The main algorithm satisfies several new lower bounds


Correct Process Negative Statement Failure Detector Communication Step Broadcast Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aguilera, M.K., Delporte-Gallet, C., Fauconnier, H., Toueg, S.: Thrifty generic broadcast. In: Herlihy, M.P. (ed.) DISC 2000. LNCS, vol. 1914, pp. 268–282. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  2. 2.
    Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. Journal of the ACM 43(2), 225–267 (1996)MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Chandra, T.D., Hadzilacos, V., Toueg, S.: The weakest failure detector for solving Consensus. Journal of the ACM 43(4), 685–722 (1996)MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Défago, X., Schiper, A., Urbán, P.: Total order broadcast and multicast algorithms: Taxonomy and survey. ACM Computing Surveys 36(4), 372–421 (2004)CrossRefGoogle Scholar
  5. 5.
    Ezhilchelvan, P., Palmer, D., Raynal, M.: An optimal Atomic Broadcast protocol and an implementation framework. In: Proceedings of the 8th IEEE International Workshop on Object-Oriented Real-Time Dependable Systems, pp. 32–41 (January 2003)Google Scholar
  6. 6.
    Hadzilacos, V., Toueg, S.: A modular approach to fault-tolerant broadcasts and related problems. Technical Report TR94-1425, Cornell University, Computer Science Department (May 1994)Google Scholar
  7. 7.
    Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Communications of the ACM 21(7), 558–565 (1978)MATHCrossRefGoogle Scholar
  8. 8.
    Mostéfaoui, A., Raynal, M.: Low cost Consensus-based Atomic Broadcast. In: Proceedings of the 2000 Pacific Rim International Symposium on Dependable Computing, pp. 45–52. IEEE Computer Society, Los Alamitos (2000)CrossRefGoogle Scholar
  9. 9.
    NTP. Network Time Protocol (2006), URL:
  10. 10.
    Pedone, F., Schiper, A.: Optimistic Atomic Broadcast: a pragmatic viewpoint. Theoretical Computer Science 291(1), 79–101 (2003)MATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Pedone, F., Schiper, A.: On the inherent cost of Generic Broadcast. Technical Report IC/2004/46, Swiss Federal Institute of Technology (EPFL) (May 2004)Google Scholar
  12. 12.
    Pedone, F., Schiper, A.: Generic broadcast. In: Jayanti, P. (ed.) DISC 1999. LNCS, vol. 1693, pp. 94–106. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  13. 13.
    Vicente, P., Rodrigues, L.: An indulgent uniform total order algorithm with optimistic delivery. In: Proceedings of 21st Symposium on Reliable Distributed Systems, Osaka, Japan. IEEE Computer Society Press, Los Alamitos (2002)Google Scholar
  14. 14.
    Zieliński, P.: Optimistic generic broadcast. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol. 3724, pp. 369–383. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  15. 15.
    Zieliński, P.: Low-latency Atomic Broadcast in the presence of contention. Technical Report UCAM-CL-TR-671, Computer Laboratory, University of Cambridge (July 2006), Available at:

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Piotr Zieliński
    • 1
  1. 1.University of Cambridge Cavendish Laboratory 

Personalised recommendations