Abstract
Message ordering is a fundamental abstraction in distributed systems. However, usual ordering guarantees are purely “syntactic”, that is, message “semantics” is not taken into consideration, despite the fact that in several cases, semantic information about messages leads to more efficient message ordering protocols. In this paper we define the Generic Broadcast problem, which orders the delivery of messages only if needed, based on the semantics of the messages. Semantic information about the messages is introduced in the system by a conflict relation defined over message. We show that Reliable and Atomic Broadcast are spe- cial cases of Generic Broadcast, and propose an algorithm that solves Generic Broadcast efficiently. In order to assess efficiency, we introduce the concept of delivery latency.
Abstract
Research supported by the EPFL-ETHZ DRAGON project and OFES under con- tract number 95.0830, as part of the ESPRIT BROADCAST-WG (number 22455).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
K. Birman and T. Joseph. Reliable Communication in the Presence of Failures. ACM Transactions on Computer Systems, 5(1):47–76, February 1987.
T. D. Chandra and S. Toueg. Unreliable failure detectors for reliable distributed systems. Journal of the ACM, 43(2):225–267, March 1996.
D.K. Gifford. Weighted Voting for Replicated Data. In Proceedings of the 7th Symposium on Operating Systems Principles, pages 150–159, December 1979.
V. Hadzilacos and S. Toueg. Fault-Tolerant Broadcasts and Related Problems. In Distributed Systems, chapter 5. Addison Wesley, second edition, 1993.
M. Herlihy. A Quorum-Consensus Replication Method for Abstract Data Types. ACM Transactions on Computer Systems, 4(1):32–53, February 1986.
S. Jajodia and D. Mutchler. Dynamic Voting. In Proc. of the ACM SIGMOD Int. Conference on Management of Data, pages 227–238, May 1987.
L. Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, 21(7):558–565, July 1978.
F. Pedone and A. Schiper. Optimistic Atomic Broadcast. In Proc. of 12th International Symposium on Distributed Computing, pages 318–332, September 1998.
F. Pedone and A. Schiper. Generic broadcast. Technical Report SSC/1999/012, EPFL, Communication Systems Department, April 1999.
S. Ghemawat R. Ladin, B. Liskov. Providing High Availability Using Lazy Replication. ACM Transactions on Computer Systems, 10(4):360–391, November 1992.
A. Schiper. Early consensus in an asynchronous system with a weak failure detector. Distributed Computing, 10(3):149–157, 1997.
F. B. Schneider. Implementing fault-tolerant services using the state machine approach: A tutorial. ACM Computing Surveys, 22(4):299–319, December 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pedone, F., Schiper, A. (1999). Generic Broadcast. In: Jayanti, P. (eds) Distributed Computing. DISC 1999. Lecture Notes in Computer Science, vol 1693. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48169-9_7
Download citation
DOI: https://doi.org/10.1007/3-540-48169-9_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66531-1
Online ISBN: 978-3-540-48169-0
eBook Packages: Springer Book Archive