Skip to main content
SpringerLink
Log in

Low-latency atomic broadcast in the presence of contention

  • Published:
Distributed Computing Aims and scope Submit manuscript

Abstract

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 the order of these timestamps. Both positive and negative statements are used: “m broadcast at time 51” vs. “no messages broadcast between times 31 and 51”. To prevent crashed processes from blocking the system, the \({\Omega}\) -elected leader broadcasts negative statements on behalf of the processes it suspects (\({\lozenge S}\)) to have crashed. A new cheap Generic Broadcast algorithm is used to ensure consistency between conflicting statements. It 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, which are proved in this paper.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Agrawal, D., Alonso, G., Abbadi, A.E., Stanoi, I.: Exploiting Atomic Broadcast in replicated databases (extended abstract). In: European Conference on Parallel Processing, pp. 496–503 (1997)

  2. Aguilera, Lann L., Toueg.: On the impact of fast failure detectors on real-time fault-tolerant systems. In: DISC: International Symposium on Distributed Computing. LNCS (2002)

  3. Aguilera, M.K., Delporte-Gallet, C., Fauconnier, H., Toueg, S.: Thrifty Generic Broadcast. In: Proceedings of the 14th International Symposium on Distributed Computing, Toledo, Spain, pp. 268–282 (2000)

  4. Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. J. ACM 43(2), 225–267 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  5. Chandra, T.D., Hadzilacos, V., Toueg, S.: The weakest failure detector for solving consensus. J. ACM 43(4), 685–722 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  6. Cristian, F., Mishra, S., Alvarez, G.: The pinwheel asynchronous atomic broadcast protocols. In: Proceedings of the 2nd International Symposium on Autonomous Decentralized Systems, Phoenix (1995)

  7. Défago, X., Schiper, A., Urbán, P.: Total order broadcast and multicast algorithms: taxonomy and survey. ACM Comput. Surv. 36(4), 372–421 (2004)

    Article  Google Scholar 

  8. 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, January 2003, pp. 32–41 (2003)

  9. Guerraoui, R., Oliveira, R., Schiper, A.: Stubborn Communication Channels. Technical Report 98/272. Swiss Federal Institute of Technology, Switzerland (1998)

  10. 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 (1994)

  11. Lamport, L.: Implementation of reliable distributed multiprocess systems. Comput. Networks Int. J. Distrib. Inform. 2(2), 95–114 (1978). ISSN: 0376-5075

  12. Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21(7), 558–565 (1978)

    Article  MATH  Google Scholar 

  13. Lampson, B.W.: How to build a highly available system using Consensus. In: Babaoglu, O., Marzullo, K. (eds), 10th International Workshop on Distributed Algorithms (WDAG), vol. 1151, pp. 1–17. Springer, Berlin (1996)

  14. 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 (2000)

  15. NTP. Network Time Protocol, 2006. URL http://www.ntp.org/

  16. Pedone, F., Schiper, A.: Optimistic Atomic Broadcast: a pragmatic viewpoint. Theor. Comput. Sci. 291(1), 79–101 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  17. Pedone, F., Schiper, A.: On the inherent cost of Generic Broadcast. Technical Report IC/2004/46, Swiss Federal Institute of Technology (EPFL), May (2004)

  18. Pedone, F., Schiper, A.: Generic Broadcast. In: Proceedings of the 13th International Symposium on Distributed Computing, pp. 94–108 (1999)

  19. Pedone, F., Guerraoui, R., Schiper, A.: Exploiting Atomic Broadcast in replicated databases. In: Proceedings of EuroPar, pp. 513–520 (1998)

  20. Schneider, F.B.: Implementing fault-tolerant services using the state machine approach: A tutorial. ACM Comput. Surv. 22(4), 299–319 (1990)

    Article  Google Scholar 

  21. 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 (2002)

  22. Zieliński, P.: Optimistic Generic Broadcast. In: Proceedings of the 19th International Symposium on Distributed Computing, September 2005, pp. 369–383. Kraków, Poland (2005)

Download references

Author information

Authors and Affiliations

  1. Cavendish Laboratory, University of Cambridge, Cambridge, UK

    Piotr Zieliński

Authors
  1. Piotr Zieliński
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zieliński, P. Low-latency atomic broadcast in the presence of contention. Distrib. Comput. 20, 435–450 (2008). https://doi.org/10.1007/s00446-007-0052-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00446-007-0052-y

Keywords

Search

Navigation