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
Detection of Orthogonal Interval Relations
HiPC '02 Proceedings of the 9th International Conference on High Performance Computing
Causality-Based Predicate Detection across Space and Time
IEEE Transactions on Computers
Causality-Based Predicate Detection across Space and Time
IEEE Transactions on Computers
Data-stream-based global event monitoring using pairwise interactions
Journal of Parallel and Distributed Computing
Predicate detection using event streams in ubiquitous environments
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
Analysis of interval-based global state detection
ICDCIT'05 Proceedings of the Second international conference on Distributed Computing and Internet Technology
| Hi-index | 0.01 |
This paper presents an algorithm for global state detection based on peer-to-peer interactions. The interactions in distributed systems can be analyzed in terms of the peer-to-peer pairwise interactions of intervals between processes. 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 peer processes, how can such a global state be detected?” Devising an efficient algorithm is a challenge because of the overhead of having to track the intervals at different processes. We devise a distributed on-line algorithm to efficiently manage the distributed data structures and solve this problem. We prove the correctness of the algorithm and analyze its complexity.