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
On Coordinated Checkpointing in Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
An Index-Based Checkpointing Algorithm for Autonomous Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Quasi-Synchronous Checkpointing: Models, Characterization, and Classification
IEEE Transactions on Parallel and Distributed Systems
Communication-Induced Determination of Consistent Snapshots
IEEE Transactions on Parallel and Distributed Systems
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Models and issues in data stream systems
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A survey of rollback-recovery protocols in message-passing systems
ACM Computing Surveys (CSUR)
Continuous queries over data streams
ACM SIGMOD Record
Finding Consistent Global Checkpoints in a Distributed Computation
IEEE Transactions on Parallel and Distributed Systems
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
The Impact of Data Aggregation in Wireless Sensor Networks
ICDCSW '02 Proceedings of the 22nd International Conference on Distributed Computing Systems
A Fine-Grained Modality Classification for Global Predicates
IEEE Transactions on Parallel and Distributed Systems
Distributed algorithm to detect strong conjunctive predicates
Information Processing Letters
Causality and atomicity in distributed computations
Distributed Computing
A Parallel Algorithm for Correlating Event Streams
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
TAG: a Tiny AGgregation service for Ad-Hoc sensor networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
TinyDB: an acquisitional query processing system for sensor networks
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
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
Temporal Predicate Detection Using Synchronized Clocks
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
Analysis of interval-based global state detection
ICDCIT'05 Proceedings of the Second international conference on Distributed Computing and Internet Technology
Composite event detection as a generic middleware extension
IEEE Network: The Magazine of Global Internetworking
Repeated detection of conjunctive predicates in distributed executions
Information Processing Letters
From the Happened-Before Relation to the Causal Ordered Set Abstraction
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
The problem of global state observation is fundamental to distributed systems and to the analysis of data streams. Many interactions in distributed systems can be analyzed in terms of the building block formed by the pairwise interactions of intervals at two processes. Considering causality-based pairwise interactions by which two processes may interact with each other, there are 40 orthogonal interaction types. For each pair of processes (P"i,P"j), let interaction type r"i","j be of interest. This paper examines the problem: ''If a global state of interest to an application is specified in terms of such pairwise interaction types, one per pair of processes, how can such a global state be detected?'' A solution identifies a global state in which the interaction type specified for each process pair is satisfied. This paper formulates the specific conditions on the communication structures to determine which of the intervals being examined at any time may never satisfy the stipulated interaction type for that pair of processes, and therefore that interval(s) need no longer be considered as forming a part of any solution. Based on this theory, the paper proposes two on-line distributed algorithms to solve the problem.