Repeated detection of conjunctive predicates in distributed executions |
| |
Authors: | Ajay D Kshemkalyani |
| |
Affiliation: | University of Illinois at Chicago, Chicago, IL 60607, United States |
| |
Abstract: | Given a conjunctive predicate ? over a distributed execution, this paper gives an algorithm to detect all interval sets, each interval set containing one interval per process, in which the local values satisfy the Definitely(?) modality. The time complexity of the algorithm is O(n3p), where n is the number of processes and p is the bound on the number of times a local predicate becomes true at any process. The paper also proves that unlike the Possibly(?) modality which admits O(pn) solution interval sets, the Definitely(?) modality admits O(np) solution interval sets. The paper also gives an on-line test to determine whether all solution interval sets can be detected in polynomial time under arbitrary fine-grained causality-based modality specifications. |
| |
Keywords: | Distributed computing Predicate detection Intervals Monitoring Causality Global state |
本文献已被 ScienceDirect 等数据库收录! |
|