Abstract
This paper presents an Optimistic Atomic Broadcast algorithm (OPT-ABcast) that exploits the spontaneous total order message reception property experienced in local area networks, in order to allow fast delivery of messages. The OPT-ABcast algorithm is based on the Optimistic Consensus problem (OPT-Consensus) that allows processes to decide optimistically or conservatively. A process optimistically decides if it knows that the spontaneous total order message reception property holds, otherwise it decides conservatively. We evaluate the efficiency of the OPT-ABcast and the OPT-Consensus algorithms using the notion of latency degree.
Research supported by the EPFL-ETHZ DRAGON project and OFES under contract number 95.0830, as part of the ESPRIT BROADCAST-WG (number 22455).
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Y. Amir, L. Moser, P. Melliar-Smith, D. Agarwal, and P. Ciarfella. Fast Message Ordering and Membership Using a Logical Token-Passing Ring. In Proceedings of the 13th International Conference on Distributed Computing Systems, pages 551–560, May 1993.
P. Bernstein, V. Hadzilacos, and N. Goodman. Concurrency Control and Recovery in Database Systems. Addison-Wesley, 1987.
K. Birman, A. Schiper, and P. Stephenson. Lightweight Causal and Atomic Group Multicast. ACM Transactions on Computer Systems, 9(3):272–314, August 1991.
T. D. Chandra and S. Toueg. Unreliable failure detectors for reliable distributed systems. Journal of the ACM, 43(2):225–267, March 1996.
J. M. Chang and N. Maxemchuck. Reliable Broadcast Protocols. ACM Transactions on Computer Systems, 2(3):251–273, August 1984.
H. Garcia-Molina and A. Spauster. Ordered and Reliable Multicast Communication. ACM Transactions on Computer Systems, 9(3):242–271, August 1991.
R. Guerraoui, M. Larrea, and A. Schiper. Reducing the cost for non-blocking in atomic commitment. In Proceedings of the 16th International Conference on Distributed Computing Systems, pages 692–697, May 1996.
P. Jalote. Efficient ordered broadcasting in reliable csma/cd networks. In Proceedings of the 18th International Conference on Distributed Computing Systems, pages 112–119, May 1998.
H. T. Kung and J. T. Robinson. On optimistic methods for concurrency control. ACM Transactions on Database Systems, 6(2):213–226, June 1981.
L. Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, 21(7):558–565, July 1978.
S. W. Luan and V. D. Gligor. A Fault-Tolerant Protocol for Atomic Broadcast. IEEE Trans. Parallel & Distributed Syst., 1(3):271–285, July 90.
F. Pedone and A. Schiper. Optimistic atomic broadcast. Technical Report TR-98/280, EPFL, Computer Science Department, 1998.
A. Schiper. Early consensus in an asynchronous system with a weak failure detector. Distributed Computing, 10(3):149–157, 1997.
U. Wilhelm and A. Schiper. A Hierarchy of Totally Ordered Multicasts. In Proceedings of the 14th IEEE Symp. on Reliable Distributed Systems, pages 106–115, September 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pedone, F., Schiper, A. (1998). Optimistic Atomic Broadcast. In: Kutten, S. (eds) Distributed Computing. DISC 1998. Lecture Notes in Computer Science, vol 1499. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0056492
Download citation
DOI: https://doi.org/10.1007/BFb0056492
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65066-9
Online ISBN: 978-3-540-49693-9
eBook Packages: Springer Book Archive