Characterizing and Detecting the Set of Global States Seen by all Observers of a Distributed Computation

Authors:
E. Fromentin;M. Raynal
Affiliations:
-;-
Venue:
ICDCS '95 Proceedings of the 15th International Conference on Distributed Computing Systems
Year:
1995

Citing 0
Cited 5

Auditing Causal Relationships of Group Multicast Communications in Group-Oriented Distributed Systems

The Journal of Supercomputing
Detecting global predicates in distributed systems with clocks

Distributed Computing
Vector time and causality among abstract events in distributed computations

Distributed Computing
Graphical design tool for parallel programs with execution control based on global application states

ISPDC'03 Proceedings of the Second international conference on Parallel and distributed computing
Strongly consistent global states detection using relative clock errors

ISPDC'03 Proceedings of the Second international conference on Parallel and distributed computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Abstract: 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 concentrates on what all these observations have in common. An abstraction called common global state is defined. A necessary and sufficient condition characterizing such states is given. A monitor-based algorithm that detects them is also presented and proved correct. Previous works on detection of unstable properties of distributed computations are revisited and explained with this abstraction. Moreover other uses of such particular states are sketched.