Abstract
We present a general protocol for detecting whether a property holds in a distributed system, where the property is a member of a subclass of stable properties we call the locally stable properties. Our protocol is based on a decentralized method of constructing a maximal subset of the local states that are mutually consistent, which in turn is based on a weakened version of vector time stamps. The structure of our protocol lends itself to refinement, and we demonstrate its utility by deriving some specialized property-detection protocols, including two previously-known protocols that are known to be efficient.
This work was supported by the Defense Advanced Research Projects Agency (DoD) under NASA Ames grant number NAG 2-593, and by grants from IBM and Siemens. The views, opinions, and findings contained in this report are those of the authors and should not be construed as an official Department of Defense position, policy, or decision.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
K. Birman, A. Schiper, and P. Stephenson. Fast causal multicast. Technical Report TR-90-1105, Cornell University, April 1990. Submitted for publication.
G. Bracha and Sam Toueg. A distributed algorithm for generalized deadlock detection. In Proceedings of the Symposium on Principles of Distributed Computing, pages 285–301. ACM SIGPLAN/SIGOPS, August 1984.
K. Mani Chandy, Laura M. Haas, and Jayadev Misra. Distributed deadlock detection. ACM Transactions on Computer Systems, 1(2):144–156, May 1983.
K. Mani Chandy and Leslie Lamport. Distributed snapshots: determining global states of distributed systems. ACM Transactions on Computer Systems, 3(1):63–75, February 1985.
K. Mani Chandy and Jayadev Misra. An example of stepwise refinement of distributed programs: Queiscence detection. ACM Transactions on Programming Languages and Systems, 8(3):326–343, July 1986.
Edsger W. Dijkstra and E. Scholten. Termination detection for diffusing computations. Information Processing Letters, 11(1):1–4, 1980.
Leslie Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, 21(7):558–565, July 1978.
Friedemann Mattern. Algorithms for distributed termination detection. Distributed Computing, 2(3):161–175, 1987.
Friedemann Mattern. Time and global states of distributed systems. In Michel Cosnard et. al., editor, Proceedings of the International Workshop on Parallel and Distributed Algorithms, pages 215–226. North-Holland, October 1989.
Jayadev Misra. Detecting termination of distributed computations using markers. In Proceedings of the Symposium on Principles of Distributed Computing, pages 290–294. ACM SIGPLAN/SIGOPS, August 1983.
Larry L. Peterson. Preserving context information in an IPC abstraction. In Proceedings of the 6th Symposium on Reliability in Distributed Software and Database Systems, pages 22–31, March 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Marzullo, K., Sabel, L. (1992). Using consistent subcuts for detecting stable properties. In: Toueg, S., Spirakis, P.G., Kirousis, L. (eds) Distributed Algorithms. WDAG 1991. Lecture Notes in Computer Science, vol 579. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022453
Download citation
DOI: https://doi.org/10.1007/BFb0022453
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55236-9
Online ISBN: 978-3-540-46789-2
eBook Packages: Springer Book Archive