Detecting Locally Stable Predicates Without Modifying Application Messages

In this paper, we give an efficient algorithm to determine whether a locally stable predicate has become true in an underlying computation. Examples of locally stable predicates include termination and deadlock. 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. Once the predicate becomes true, the detection latency (or delay) of our algorithm is proportional to the time-complexity of computing a (possibly inconsistent) snapshot of the system. Moreover, only O(n) control messages are required to detect the predicate once it holds, where n is the number of processes.

• Type: Conference
• Year: 2003
• Where: OPODIS
• Authors: Ranganath Atreya, Neeraj Mittal, Vijay K. Garg
• Keywords: Efficient Algorithm, OPODIS 2003, OPODIS 2007, Predicates Include Termination, Stable Predicates