Information Processing Letters
Termination detection for dynamically distributed systems with non-first-in-first-out communication
Journal of Parallel and Distributed Computing
Deadlock detection in distributed databases
ACM Computing Surveys (CSUR)
An overview of clock synchronization
Fault-tolerant distributed computing
Efficient algorithms for distributed snapshots and global virtual time approximation
Journal of Parallel and Distributed Computing - Special issue on parallel and discrete event simulation
Distributed termination detection with roughly synchronized clocks
Information Processing Letters
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Distributed termination detection for dynamic systems
Parallel Computing
A taxonomy of distributed termination detection algorithms
Journal of Systems and Software
Building Secure and Reliable Network Applications
Building Secure and Reliable Network Applications
Distributed Algorithms
Detection of Global State Predicates
WDAG '91 Proceedings of the 5th International Workshop on Distributed Algorithms
Detecting Global Predicates in Distributed Systems with Clocks
WDAG '97 Proceedings of the 11th International Workshop on Distributed Algorithms
Global predicates in rough real time
SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing
Detecting global predicates in distributed systems with clocks
Distributed Computing
Detecting stable locality-aware predicates
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
Detection of stable predicates is fundamental to distributed application development and control. Stable predicates are distinguished by the fact that once they are true in some consistent global state, they remain true indefinitely. We present a protocol for the detection of stable predicates within dynamic systems (in which process membership may not be static). Unlike existing protocols, the presented protocol is not restricted to the detection of distributed termination and is based upon the use of approximately synchronized clocks. When clocks are approximately synchronized, the difference between the readings of any two clocks at an instant of time is kept within some known bound. Although clocks are assumed to be synchronized, temporary loss of synchronization is tolerated. The use of a global time base facilitates detection of predicates that remain true only after becoming true at some instant of time, while correctly detecting predicates that remain true upon becoming true in some consistent global state.