Return
Predicate control: synchronization in distributed computations with look-ahead
DOI:10.1016/j.jpdc.2003.11.004.png)
Abstract
En 中文
The predicate control problem involves synchronizing a distributed computation to maintain a given global predicate. In contrast with many popular distributed synchronization problems such as mutual exclusion, readers writers, and dining philosophers, predicate control assumes a look-ahead, so that the computation is an off-line rather than an on-line input. Predicate control is targeted towards applications such as rollback recovery, debugging, and optimistic computing, in which such computation look-ahead is natural. We define predicate control formally and show that, in its full generality, the problem is NP-complete. We find efficient solutions for some important classes of predicates including disjunctive predicates, mutual exclusion predicates, and readers writers predicates. For each class of predicates, we determine the necessary and sufficient conditions for solving predicate control and describe an efficient algorithm for determining a synchronization strategy. In the case of independent mutual exclusion predicates, we determine that predicate control is NP-complete and describe an efficient algorithm that finds a solution under certain constraints. (C) 2003 Elsevier Inc. All rights reserved.
Keywords:
predicate control
synchronization
distributed computation
predicate detection
mutual exclusion
rollback recovery
distributed debugging
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4
Papers:
3.8K
Citations:
4.8K
Organization
No organization information available

