Using consistent subcuts for detecting stable properties

  • Keith Marzullo
  • Laura Sabel
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 579)


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.


Stable Property Global State Relevant Event General Protocol Deadlock Detection 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    K. Birman, A. Schiper, and P. Stephenson. Fast causal multicast. Technical Report TR-90-1105, Cornell University, April 1990. Submitted for publication.Google Scholar
  2. [2]
    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.Google Scholar
  3. [3]
    K. Mani Chandy, Laura M. Haas, and Jayadev Misra. Distributed deadlock detection. ACM Transactions on Computer Systems, 1(2):144–156, May 1983.Google Scholar
  4. [4]
    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.Google Scholar
  5. [5]
    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.Google Scholar
  6. [6]
    Edsger W. Dijkstra and E. Scholten. Termination detection for diffusing computations. Information Processing Letters, 11(1):1–4, 1980.Google Scholar
  7. [7]
    Leslie Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, 21(7):558–565, July 1978.Google Scholar
  8. [8]
    Friedemann Mattern. Algorithms for distributed termination detection. Distributed Computing, 2(3):161–175, 1987.Google Scholar
  9. [9]
    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.Google Scholar
  10. [10]
    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.Google Scholar
  11. [11]
    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.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Keith Marzullo
    • 1
  • Laura Sabel
    • 1
  1. 1.Department of Computer ScienceCornell UniversityIthacaUSA

Personalised recommendations