Checkpointing and Rollback-Recovery for Distributed Systems
IEEE Transactions on Software Engineering - Special issue on distributed systems
Consistent detection of global predicates
PADD '91 Proceedings of the 1991 ACM/ONR workshop on Parallel and distributed debugging
On characterization and correctness of distributed deadlock detection
Journal of Parallel and Distributed Computing
Local and temporal predicates in distributed systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Temporal interactions of intervals in distributed systems
Journal of Computer and System Sciences
A framework for viewing atomic events in distributed computations
Theoretical Computer Science - Special issue on parallel computing
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
A survey of rollback-recovery protocols in message-passing systems
ACM Computing Surveys (CSUR)
Interval consistency of asynchronous distributed computations
Journal of Computer and System Sciences
Detection of Orthogonal Interval Relations
HiPC '02 Proceedings of the 9th International Conference on High Performance Computing
Virtual Precedence in Asynchronous Systems: Cencept and Applications
WDAG '97 Proceedings of the 11th International Workshop on Distributed Algorithms
A Fine-Grained Modality Classification for Global Predicates
IEEE Transactions on Parallel and Distributed Systems
Detecting causal relationships in distributed computations: in search of the holy grail
Distributed Computing
Causality-Based Predicate Detection across Space and Time
IEEE Transactions on Computers
Global state detection based on peer-to-peer interactions
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
Data-stream-based global event monitoring using pairwise interactions
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
The problem of global state observation is fundamental to distributed systems. All interactions in distributed systems can be analyzed in terms of the building block formed by the pairwise interactions of intervals between two processes. Considering causality-based pairwise interactions by which two intervals at different processes may interact with each other, there are 40 possible orthogonal interactions. This paper examines the problem: “If a global state of interest to an application is specified in terms of the pairwise interaction types between each pair of processes, how can such a global state be detected?” A solution identifies a global state in which the relation specified for each process pair is satisfied. This paper formulates the specific conditions on the exact communication structures to determine which of the intervals being examined at any time may never satisfy the stipulated relation for that pair of processes, and therefore that interval must be deleted.