Real-Time Systems

, Volume 2, Issue 3, pp 195–212 | Cite as

Synchronous atomic broadcast for redundant broadcast channels

  • Flaviu Cristian


We propose a synchronous atomic broadcast protocol for distributed real-time systems based on redundant broadcast channels. The protocol can tolerate a finite number f of concurrent processor crash failures, channel adapter performance failures and channel omission failures. Its message cost is optimal: when no failures occur only f+1 messages are sent per broadcast. The cost implications of providing tolerance to other failure classes are also investigated.


Operating System Finite Number Adapter Computing Methodology Adapter Performance 
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. Babaoglu, O., Drumond, R. 1985. Streets of Byzantium: Network architectures for fast reliable broadcast. IEEE Tr. on Software Engineering, SE-11, (6).Google Scholar
  2. Birman, K., Joseph, T. 1987. Reliable communication in the presence of failures. ACM Tr. on Computer Systems, 5, (1) (Feb.).Google Scholar
  3. Carr, R. 1985. The tandem global update protocol. Tandem Systems Review, 1 (2) (June).Google Scholar
  4. Cristian, F., Aghili, H., Strong, R., Dolev., D. 1985. Atomic Broadcast; From Simple Diffusion to Byzantine Agreement, FTCS15, Ann Arbor, Michigan, (also IBM Research report RJ 4540, October 1984).Google Scholar
  5. Chang, J.M., Maxemchuck, N. 1984. Reliable Broadcast Protocols, ACM Tr. on Computer Systems, 2, (3) (Aug.).Google Scholar
  6. Cristian, F. 1989. Probabilistic Clock Synchronization. Distributed Computing, 3:146–158.Google Scholar
  7. Dolev, D., Strong, R., Cristian, F. 1989. Distinguishing Timing Failures from Clock Failures. IBM Research Report RJ 7150, (Nov.).Google Scholar
  8. Gallager, R. 1985. A Perspective on Multiaccess Channels. IEEE Trans. on Information Theory, IT-31, 2, (March).Google Scholar
  9. Garcia-Molina, H., Spauster, A. 1989. Message Ordering in a Multicast Environment. 9th Int. Conf. on Distributed Systems. Newport Beach, California.Google Scholar
  10. Lamport, L. 1989. The Part-time Parliament. DEC-SRC Research Report. 49.Google Scholar
  11. Metcalfe, R., Boggs, D. 1976. Ethernet: Distributed Packet Switching for Local Computer Networks, CACM, 19, (7): 395–404.Google Scholar
  12. Melliar-Smith, M., Moser, L. 1989. Fault-Tolerant Distributed Systems Based on Broadcast Communication. 9th Int Conf. on Distributed Systems. Newport Beach, California.Google Scholar
  13. Strong, R., Skeen, D., Cristian, F., Aghili, H. 1987. Handshake Protocols. 7th Int. Conf. on Distributed Computing Systems. Berlin.Google Scholar
  14. Tusch, J., Meyr, H., Zurfluh, E. 1988. Error Handling Performance of a Token Ring Local Area Network. 13th IEEE Int. Conf. on Local Area Networks. Minneapolis, Minnesota.Google Scholar
  15. Verissimo, P., Rodriques, L., Marques, J. 1987. Atomic Multicast Extensions for 802.4 Token Bus. 11th Int. Fiber Optic Communications and Local Area Networks Exposition. Anaheim, California.Google Scholar

Copyright information

© Kluwer Academic Publishers 1990

Authors and Affiliations

  • Flaviu Cristian
    • 1
  1. 1.IBM Almaden Research CenterSan JoseUSA

Personalised recommendations