Shared Global States in Distributed Computations

A consistent observation of a given distributed computation is a sequence of global states that could be produced by executing that computation on a monoprocessor system. Therefore a distributed execution generally accepts several consistent observations. This paper investigates global states shared by all such observations. A necessary and sufficient condition characterizing these states is first given. Then, an algorithm that computes shared global states is described.

[1]  E. Szpilrajn Sur l'extension de l'ordre partiel , 1930 .

[2]  S. Venkatesan,et al.  Testing and Debugging Distributed Programs Using Global Predicates , 1995, IEEE Trans. Software Eng..

[3]  Michel Raynal,et al.  Characterizing and detecting the set of global states seen by all observers of a distributed computation , 1995, Proceedings of 15th International Conference on Distributed Computing Systems.

[4]  Michel Raynal,et al.  A unified framework for the specification and run-time detection of dynamic properties in distributed computations , 1996, J. Syst. Softw..

[5]  Vijay K. Garg,et al.  Some Optimal Algorithms for Decomposed Partially Ordered Sets , 1992, Inf. Process. Lett..

[6]  W. Kent Fuchs,et al.  Consistent Global Checkpoints Based on Direct Dependency Tracking , 1994, Inf. Process. Lett..

[7]  Ozalp Babaoglu,et al.  Consistent global states of distributed systems: fundamental concepts and mechanisms , 1993 .

[8]  Keith Marzullo,et al.  Consistent detection of global predicates , 1991, PADD '91.

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

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

[11]  Jean-Xavier Rampon,et al.  Reachability Analysis on Distributed Executions , 1993, TAPSOFT.

[12]  Insup Lee,et al.  Adding Time to Synchronous Process Communications , 1987, IEEE Transactions on Computers.

[13]  Vijay K. Garg,et al.  Detection of Strong Unstable Predicates in Distributed Programs , 1996, IEEE Trans. Parallel Distributed Syst..

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