Abstract
This paper derives necessary and sufficient communication for distributed applications that perform certain actions uniformly in asynchronous systems. We show there is an essential structure of information flow in any solution to Uniform Coordination, suggesting message-minimal solutions. We show it is necessary for processes to conspire against each other to make progress, and we show this conspiracy requires processes to stop communicating with each other. This, we show, renders Uniform Coordination insensitive to channel delivery guarantees. We introduce the notion of exempting processes from coordinating. We show that ‘primary partition’ behavior (Isis) arises from the desire to make exempt an process indistinguishable from a crashed process. Defining weaker exemptions for distributed coordination problems gives rise to many problems solvable in asynchronous systems as well as in systems that partition.
This research is supported by the NSF under grant number ASC-9318151, and a University Research Institute Summer Research Award from the Univerisity of Texas.
Preview
Unable to display preview. Download preview PDF.
References
Y. Amir, D. Dolev, S. Kramer, and D. Malki. Transis: A Communication Sub-System for High Availability. In 22nd FTCS, pages 76–84. IEEE, 1992.
K. P. Birman and R. van Renesse. Reliable Distributed Computing with the Isis Toolkit. IEEE Computer Society Press, 1994.
T. D. Chandra, V. Hadzilacos, and S. Toueg. The Weakest Failure Detector for Solving Consensus. In 11th PODC, pages 147–158. ACM, 1992.
K. M. Chandy and L. Lamport. Distributed Snapshots: Determining Global States of Distributed Systems. ACM TOCS, 3(1):63–75, 1985.
K. M. Chandy and J. Misra. How Processes Learn. Distributed Computing, 1(1):40–52, 1986.
B. Chor and C. Dwork. Randomization in Byzantine Agreement. Advances in Computer Research, 5:443–497, 1989.
M. J. Fischer, N. A. Lynch, and M. S. Paterson. Impossibility of Distributed Consensus with One Faulty Process. JACM, 32(2):374–382, 1985.
A. Gopal and S. Toueg. Reliable Broadcast in Synchronous and Asynchronous Environments. In 3rd WDAG-LNCS 392, pages 110–123. Springer Verlag, 1989.
J.Y. Halpern and Y. Moses. Knowledge and Common Knowledge in a Distributed Environment. JACM, 37(3):549–587, 1990.
L. Lamport. Time, Clocks and the Ordering of Events in a Distributed System. Communications of the ACM, 21(7):558–565, 1978.
L. Lamport, R. Shostak, and M. Pease. The Byzantine Generals Problem. ACM Transactions on Programming Languages and Systems, 4(3):382–401, 1982.
D. Malki, K. P. Birman, A. Ricciardi, and A. Schiper. Uniform Actions in Asynchronous Distributed Systems. In 13th PODC, pages 274–284. ACM, 1994.
A. Ricciardi. Dissecting Distributed Coordination in Asynchronous Systems. Technical Report ECE-PDS-9502, The Univerisity of Texas, 1995.
A. Ricciardi. Sequential Distributed Coordination. Technical Report ECE-PDS-9503, The Univerisity of Texas, 1995.
A. Ricciardi and K. Birman. Using Process Groups to Implement Failure Detection in Asynchronous Environments. In 10th PODC, pages 341–351. ACM, 1991.
L. Sabel and K. Marzullo. Simulating Fail-Stop in Asynchronous Distributed Systems. In 13th Symposium on Rel. Dist. Sys., pages 138–47. IEEE, 1994.
R. van Renesse, T. Hickey, and K. Birman. Design and Performance of Horus: A Lightweight Group Communications System. Technical Report 94-1441, Cornell University, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ricciardi, A. (1995). Dissecting distributed coordination. In: HĂ©lary, JM., Raynal, M. (eds) Distributed Algorithms. WDAG 1995. Lecture Notes in Computer Science, vol 972. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022141
Download citation
DOI: https://doi.org/10.1007/BFb0022141
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60274-3
Online ISBN: 978-3-540-44783-2
eBook Packages: Springer Book Archive