Detecting termination in static and dynamic systems

Ye, X.; Keane, John

doi:10.1109/icsmc.1996.565490

Cited by 2 publications

(1 citation statement)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…On-line algorithms for monitoring global events using pair-wise interactions in peer-to-peer systems have been proposed by Chandra and Kshemkalyani [35]. Most of the existing schemes for detecting stable predicates are for static systems although several algorithms have been proposed for termination detection in dynamic systems [10], [12], [14], [20], [22], [36], [37].…”

Section: Introductionmentioning

confidence: 99%

Detection of Conjunctive Stable Predicates in Dynamic Systems

Wang

Mayo

Hembroff

et al. 2009

2009 15th International Conference on Parallel and Distributed Systems

View full text Add to dashboard Cite

We present a distributed on-line algorithm for detecting conjunctive stable predicates in dynamic systems. The algorithm consists of a virtual network topology to maintain the causality relationships between distributed events and protocols to check the verification of the predicates over consistent global states. A lazy detection protocol has been developed to minimize the number of messages for the detection. Let Mc be the number of detection messages, then the message complexity of the algorithm is Mc ≤ M + n0, where M is the number of computation messages and n0 is the number of initial processes the computation starts with. Computation trees are maintained in the virtual network to reduce the detection delay. Suppose that hmax is the maximum height of the computation trees. The detection delay is O(hmax + n0). It has been proved that a solution is declared if and only if the global predicate is verified during the progress of the underlying distributed computation.

show abstract