Abstract | ||
---|---|---|
Global predicate detection is a fundamental problem in distributed systems and finds applications in many domains such as testing and debugging distributed programs. This paper presents an efficient distributed algorithm to detect conjunctive form global predicates in distributed systems. The algorithm detects the first consistent global state that satisfies a given conjunction of local predicates. The algorithm is distributed because the predicate detection efforts as well as the necessary information is equally distributed among the processes. |
Year | DOI | Venue |
---|---|---|
1996 | 10.1109/SPDP.1996.570388 | SPDP |
Keywords | Field | DocType |
predicate detection effort,local predicate,consistent global state,global predicate,on-the-fly detection,fundamental problem,necessary information,local predicates,conjunctive form,global predicate detection,debugging,distributed systems,computational modeling,distributed computing,distributed algorithms,computer networks,system testing,concurrent computing | Computer science,Parallel computing,On the fly,Theoretical computer science,Distributed algorithm,Predicate (grammar),Program testing,Debugging,Computation,Distributed computing | Conference |
ISBN | Citations | PageRank |
0-8186-7683-3 | 2 | 0.42 |
References | Authors | |
5 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Michel Hurfin | 1 | 266 | 29.30 |
Michel Raynal | 2 | 4078 | 349.46 |
Masaaki Mizuno | 3 | 338 | 34.49 |
Mukesh Singhal | 4 | 2602 | 259.07 |