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)
The derivation of graph marking algorithms from distributed termination detection protocols
Science of Computer Programming
Generational reference counting: a reduced-communication distributed storage reclamation scheme
PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
A message-optimal algorithm for distributed termination detection
Journal of Parallel and Distributed Computing
Lightweight causal and atomic group multicast
ACM Transactions on Computer Systems (TOCS)
The derivation of distributed termination detection algorithms from garbage collection schemes
ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Distributed deadlock detection
ACM Transactions on Computer Systems (TOCS)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Concepts and paradigms of object-oriented programming
ACM SIGPLAN OOPS Messenger
Using Consistent Subcuts for Detecting Stable Properties
WDAG '91 Proceedings of the 5th International Workshop on Distributed Algorithms
Starting with termination: a methodology for building distributed garbage collection algorithms
ACSC '01 Proceedings of the 24th Australasian conference on Computer science
Universal Constructs in Distributed Computations
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Efficient detection of a class of stable properties
Distributed Computing
Detecting Arbitrary Stable Properties Using Efficient Snapshots
IEEE Transactions on Software Engineering
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
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Proceedings of the 4th annual Symposium on Cloud Computing
Detecting stable locality-aware predicates
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
A stable property in a distributed system is a global property which once true, remains true forever. This paper refines this notion by formally introducing the concept of strong stable properties. A strong stable property has the nice property that it can be correctly evaluated on the consistent part of uncoordinated snapshots. Termination and deadlock are shown to be strong stable properties, whereas distributed garbage is not. We also show how to derive a simple generic algorithm for the detection of a strong stable property. The generic algorithm is illustrated by two examples: termination detection and deadlock detection. Incidentally the paper presents a very simple algorithm for termination detection.