Abstract
This paper presents a model for real-time distributed systems that is intermediate in complexity between the simple, perfectly synchronous model in which there are rounds of communication exchange among processors in a completely connected network and an asynchronous model in which there is no reasonable upper bound on the time required for transmission and processing of messages. In this model algorithms are described for atomic broadcast that can be used to update synchronous replicated storage, a distributed storage that displays the same contents at every correct processor as of any clock time. The algorithms are all based on a simple communication paradigm and differ only in the additional checking required to tolerate different classes of failures.
H. Aghili is now with the IBM T. J. Watson Research Center, Hawthorne, New York.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
O. Babaoglu, P. Stephenson, R. Drumond: “Reliable Broadcasts and Communication Models: Tradeoffs and Lower Bounds” Distributed Computing, No. 2, 1988, pp. 177–189.
K. Birman, T. Joseph: “Reliable Communication in the Presence of Failures”, ACM Transactions on Computer Systems, Vol 5, No. 1, February 1987, pp. 47–76. 1984.
R. Carr, “The Tandem Global Update Protocol”, Tandem Systems Review, June 1985, pp. 74–85.
F. Cristian, “Correct and Robust Programs,” IEEE Transactions on Software Engineering, vol. SE-10, no. 2, pp. 163–174, 1984.
F. Cristian, H. Aghili, and R. Strong, “Clock Synchronization in the Presence of Omission and Performance Faults, and Processor Joins,” 16th Int. Conf. on Fault-Tolerant Computing, Vienna, Austria, 1986.
F. Cristian, H. Aghili, R. Strong, and D. Dolev, “Atomic Broadcast: from simple message diffusion to Byzantine agreement,” IBM Research Report RJ5244, July 30, 1986.
F. Cristian, “Issues in the Design of Highly Available Computing Services,” Invited paper, Annual Symposium of the Canadian Information Processing Society, Edmonton, Alberta, 1987, pp. 9–16 (also IBM Research Report RJ5856, July 1987).
F. Cristian, “Probabilistic Clock Synchronization”, IBM Research Report RJ6432, September, 1988 (also in Proc. 8th Int. Conf. on Distributed Computing, June 1989).
J.M. Chang, and N.F. Maxemchuk, “Reliable Broadcast Protocols,” ACM Transactions on Computer Systems, vol. 2, no. 3, pp. 251–273, 1984.
“The Delta-4: Overall System Specification”, D. Powell, editor, January 1989.
D. Dolev, and R. Strong, “Authenticated Algorithms for Byzantine Agreement,” SIAM Journal of Computing, vol. 12, no. 4, pp. 656–666, 1983.
D. Dolev, J. Halpern, B. Simons, and R. Strong, “Dynamic Fault-Tolerant Clock Synchronization,” IBM Research Report RJ6722, March 3, 1989. See also “Dynamic Fault-Tolerant Clock Synchronization,” Proceedings of the 3rd Annual ACM Symposium on Principles of Distributed Computing, 1984.
M. Fischer, “The Consensus Problem in Unreliable Distributed Systems,” Proceedings of the International Conference on Foundations of Computing Theory, Sweden, 1983.
A. Griefer, and H. R. Strong, DCF: Distributed Communication with Fault-tolerance, Proceedings of the 7th Annual ACM Symposium on Principles of Distributed Computing, 1988.
L. Lamport, “Using Time instead of Time-outs in Fault-Tolerant Systems,” ACM Transactions on Programming Languages and Systems, vol. 6, no. 2, pp. 256–280, 1984.
L. Lamport, R. Shostak, and M. Pease, “The Byzantine Generals Problem,” ACM Transactions on Programming Languages and Systems, vol. 4, no. 3, pp. 382–401, July 1982.
F. Pittelli, H. Garcia-Molina, “Recovery in a Triple Modular Redundant Database System”, Technical Report CS-076-87, Princeton University, January, 1987.
W. Peterson, and E. Weldon, “Error Correction Codes,” (2nd Edition), MIT Press, Massachusetts, 1972.
R. Rivest, A. Shamir, and L. Adelman, “A Method for Obtaining Digital Signatures and Public-Key Cryptosystems,” CACM, Vol 21., no. 2, pp. 120–126, 1978.
F. Schneider: “Abstractions for Fault Tolerance in Distributed Systems,” Invited paper, Proceedings IFIP Congress '86 September 1986.
F. Schneider: “Understanding Protocols for Byzantine Clock Synchronization”, Technical report 87-859, Cornell University, August 1987.
R. Strong, and D. Dolev, “Byzantine Agreement,” Proceedings of COMPCON, Spring 1983.
R. Strong, D. Skeen, F. Cristian, H. Aghili, “Handshake Protocols” 7th Int. Conf. on Distributed Computing, September, 1987, pp. 521–528.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cristian, F., Dolev, D., Strong, R., Aghili, H. (1990). Atomic broadcast in a real-time environment. In: Simons, B., Spector, A. (eds) Fault-Tolerant Distributed Computing. Lecture Notes in Computer Science, vol 448. Springer, New York, NY. https://doi.org/10.1007/BFb0042325
Download citation
DOI: https://doi.org/10.1007/BFb0042325
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-97385-2
Online ISBN: 978-0-387-34812-4
eBook Packages: Springer Book Archive