An example of stepwise refinement of distributed programs: quiescence detection
ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
Lightweight causal and atomic group multicast
ACM Transactions on Computer Systems (TOCS)
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Consistent global states of distributed systems: fundamental concepts and mechanisms
Distributed systems (2nd Ed.)
Proving Liveness Properties of Concurrent Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed deadlock detection
ACM Transactions on Computer Systems (TOCS)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Detecting termination of distributed computations using markers
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
A distributed algorithm for generalized deadlock detection
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
On deadlock in computer systems
On deadlock in computer systems
Strong stable properties in distributed systems
Distributed Computing
Detecting causal relationships in distributed computations: in search of the holy grail
Distributed Computing
Tracking immediate predecessors in distributed computations
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Efficient Causality-Tracking Timestamping
IEEE Transactions on Knowledge and Data Engineering
Efficient dependency tracking for relevant events in shared-memory systems
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Vector time and causality among abstract events in distributed computations
Distributed Computing
Efficient detection of a locally stable predicate in a distributed system
Journal of Parallel and Distributed Computing
Detecting Arbitrary Stable Properties Using Efficient Snapshots
IEEE Transactions on Software Engineering
Efficient dependency tracking for relevant events in concurrent systems
Distributed Computing
Detecting Locally Distributed Predicates
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Nonintrusive snapshots using thin slices
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
Monitoring stable properties in dynamic peer-to-peer distributed systems
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Detecting stable locality-aware predicates
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
We present a general protocol for detecting whether a property holds in a distributed system, where the property is a member of a class of stable properties we call the locally stable properties. Our protocol is based on a decentralized method for constructing a maximal subset of the local states that are mutually consistent, which in turn is based on a weakened version of vector time stamps. The structure of our protocol lends itself to refinement, and we demonstrate its utility by deriving some specialized property-detection protocols, including two previously-known protocols that are known to be efficient.