An example of stepwise refinement of distributed programs: quiescence detection
ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Information Processing Letters
Detection of stable properties in distributed applications
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Deadlock detection in distributed databases
ACM Computing Surveys (CSUR)
Global quiescence detection based on credit distribution and recovery
Information Processing Letters
A message-optimal algorithm for distributed termination detection
Journal of Parallel and Distributed Computing
Logical Time in Distributed Computing Systems
Computer - Distributed computing systems: separate resources acting as one
Recording distributed snapshots based on casual order of message delivery
Information Processing Letters
An optimal algorithm for distributed snapshots with causal message ordering
Information Processing Letters
On characterization and correctness of distributed deadlock detection
Journal of Parallel and Distributed Computing
Introduction to distributed algorithms
Introduction to distributed algorithms
An (N -1)-Resilient Algorithm for Distributed Termination Detection
IEEE Transactions on Parallel and Distributed Systems
Detecting termination by weight-throwing in a faulty distributed system
Journal of Parallel and Distributed Computing
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Deadlock models and a general algorithm for distributed deadlock detection
Journal of Parallel and Distributed Computing
A Distributed Graph Algorithm for the Detection of Local Cycles and Knots
IEEE Transactions on Parallel and Distributed Systems
Some Deadlock Properties of Computer Systems
ACM Computing Surveys (CSUR)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
A One-Phase Algorithm to Detect Distributed Deadlocks in Replicated Databases
IEEE Transactions on Knowledge and Data Engineering
Efficient Detection and Resolution of Generalized Distributed Deadlocks
IEEE Transactions on Software Engineering
Stateless Termination Detection
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Detecting termination of distributed computations using markers
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Termination detection in data-driven parallel computations/applications
Journal of Parallel and Distributed Computing
Optimal deadlock detection in distributed systems based on locally constructed wait-for graphs
ICDCS '96 Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)
Distributed Computing: Fundamentals, Simulations and Advanced Topics
Distributed Computing: Fundamentals, Simulations and Advanced Topics
Fast, Centralized Detection and Resolution of Distributed Deadlocks in the Generalized Model
IEEE Transactions on Software Engineering
Efficient detection of a class of stable properties
Distributed Computing
Comments on "Protocols for Deadlock Detection in Distributed Database Systems"
IEEE Transactions on Software Engineering
Protocols for Deadlock Detection in Distributed Database Systems
IEEE Transactions on Software Engineering
SPDP '94 Proceedings of the 1994 6th IEEE Symposium on Parallel and Distributed Processing
Correct two-phase and one-phase deadlock detection algorithms for distributed systems
SPDP '90 Proceedings of the 1990 IEEE Second Symposium on Parallel and Distributed Processing
Detecting stable locality-aware predicates
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
We present an efficient approach to detect a locally stable predicate in a distributed computation. Examples of properties that can be formulated as locally stable predicates include termination and deadlock of a subset of processes. Our algorithm does not require application messages to be modified to carry control information (e.g., vector timestamps), nor does it inhibit events (or actions) of the underlying computation. The worst-case message complexity of our algorithm is O(n(m+1)), where n is the number of processes in the system and m is the number of events executed by the underlying computation. We show that, in practice, its message complexity should be much lower than its worst-case message complexity. The detection latency of our algorithm is O(d) time units, where d is the diameter of communication topology. Our approach also unifies several known algorithms for detecting termination and deadlock. We also show that our algorithm for detecting a locally stable predicate can be used to efficiently detect a stable predicate that is a monotonic function of other locally stable predicates.