Strong stable properties in distributed systems

SummaryA stable property in a distributed system is a global property which once true, remains true forever. This paper refines this notion by formally introducing the concept ofstrong stable properties. A strong stable property has the nice property that it can be correctly evaluated on the consistent part of uncoordinated snapshots. Termination and deadlock are shown to be strong stable properties, whereas distributed garbage is not. We also show how to derive a simple generic algorithm for the detection of a strong stable property. The generic algorithm is illustrated by two examples: termination detection and deadlock detection. Incidentally the paper presents a very simple algorithm for termination detection.

[1]  Friedemann Mattern,et al.  Virtual Time and Global States of Distributed Systems , 2002 .

[2]  Benjamin Goldberg.  Generational reference counting: a reduced-communication distributed storage reclamation scheme , 1989, PLDI '89.

[3]  Laura M. Haas,et al.  Distributed deadlock detection , 1983, TOCS.

[4]  André Schiper,et al.  Lightweight causal and atomic group multicast , 1991, TOCS.

[5]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[6]  M. Raynal,et al.  Computing particular snapshots in distributed systems , 1990, Ninth Annual International Phoenix Conference on Computers and Communications. 1990 Conference Proceedings.

[7]  Friedemann Mattern,et al.  Algorithms for distributed termination detection , 1987, Distributed Computing.

[8]  Ernest J. H. Chang,et al.  Echo Algorithms: Depth Parallel Operations on General Graphs , 1982, IEEE Transactions on Software Engineering.

[9]  Sam Toueg,et al.  Distributed deadlock detection , 2005, Distributed Computing.

[10]  Colin J. Fidge,et al.  Timestamps in Message-Passing Systems That Preserve the Partial Ordering , 1988 .

[11]  Ten-Hwang Lai,et al.  Termination Detection for Dynamically Distributed Systems with Non-first-in-first-out Communication , 1986, J. Parallel Distributed Comput..

[12]  Ten-Hwang Lai,et al.  On Distributed Snapshots , 1987, Inf. Process. Lett..

[13]  Leslie Lamport,et al.  Distributed snapshots: determining global states of distributed systems , 1985, TOCS.

[14]  Gerard Tel,et al.  The derivation of distributed termination detection algorithms from garbage collection schemes , 1991, TOPL.

[15]  Keith Marzullo,et al.  Using Consistent Subcuts for Detecting Stable Properties , 1991, WDAG.

[16]  D. I. Bevan.  An efficient reference counting solution to the distributed garbage collection problem , 1989, Parallel Comput..

[17]  Mukesh Singhal,et al.  Deadlock detection in distributed systems , 1989, Computer.

[18]  Edsger W. Dijkstra,et al.  Termination Detection for Diffusing Computations , 1980, Inf. Process. Lett..

[19]  Gerard Tel.  Distributed Infimum Approximation , 1987, FCT.

[20]  Correct two-phase and one-phase deadlock detection algorithms for distributed systems , 1990, Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing 1990.

[21]  Jan van Leeuwen,et al.  The Derivation of Graph Marking Algorithms From Distributed Termination Detection Protocols , 1988, Sci. Comput. Program..

[22]  Edgar Knapp,et al.  Deadlock detection in distributed databases , 1987, CSUR.

[23]  Subbarayan Venkatesan,et al.  A Message-Optimal Algorithm for Distributed Termination Detection , 1990, J. Parallel Distributed Comput..

[24]  Peter Wegner,et al.  Concepts and paradigms of object-oriented programming , 1990, OOPS.