Skip to main content
Article thumbnail
Location of Repository

Detecting Locally Stable Predicates without Modifying Application Messages

By Ranganath Atreya, Neeraj Mittal and Vijay K. Garg


Abstract In this paper, we give an efficient algorithm to determine whether a locally stable predicate has become true in an underlying computation. Our algorithm uses only O(n) control messages to detect the predicate once it becomes true, where n is the number of processes. Moreover, it does not require application messages to be modified to carry control information (e.g., vector timestamps). Key words: stable property, termination, deadlock, global virtual time and predicate detectio

Year: 2003
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.