Local and temporal predicates in distributed systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
Self-stabilization
Implementable Failure Detectors in Asynchronous Systems
Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
Synchronous System and Perfect Failure Detector: Solvability and Efficiency Issue
DSN '00 Proceedings of the 2000 International Conference on Dependable Systems and Networks (formerly FTCS-30 and DCCA-8)
he Timely Computing Base: Timely Actions in the Presence of Uncertain Timeliness
DSN '00 Proceedings of the 2000 International Conference on Dependable Systems and Networks (formerly FTCS-30 and DCCA-8)
Consistent Detection of Global Predicates under a Weak Fault Assumption
SRDS '00 Proceedings of the 19th IEEE Symposium on Reliable Distributed Systems
Distributed Predicate Detection in a Faulty Environment
ICDCS '98 Proceedings of the The 18th International Conference on Distributed Computing Systems
Detection of global predicates: techniques and their limitations
Distributed Computing
Detecting causal relationships in distributed computations: in search of the holy grail
Distributed Computing
Proving the Correctness of Multiprocess Programs
IEEE Transactions on Software Engineering
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
On termination detection in crash-prone distributed systems with failure detectors
Journal of Parallel and Distributed Computing
Optimal message-driven implementation of omega with mute processes
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Global predicate detection in distributed systems with small faults
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
The failure detector abstraction
ACM Computing Surveys (CSUR)
Efficient reduction for wait-free termination detection in a crash-prone distributed system
DISC'05 Proceedings of the 19th international conference on Distributed Computing
On detecting termination in the crash-recovery model
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
| Hi-index | 0.00 |
In an asynchronous system, where processes can crash, perfect predicate detection for general predicates is difficult to achieve. A general predicate thereby is of the form 驴 驴 脽, where 驴 and 脽 refer to a normal process variable and to the operational state of that process, respectively. Indeed, the accuracy of predicate detection largely depends on the quality of failure detection. In this paper, we investigate the predicate detection semantics that are achievable for general predicates using either failure detector classes 驴lP, lP, or P. For this purpose, we introduce weaker variants of the predicate detection problem, which we call stabilizing and infinitely often accurate. We show that perfect predicate detection is impossible using the aforementioned failure detectors. Rather, lP and P only allow stabilizing predicate detection. Consequently, we explore alternative approaches to perfect predicate detection: introducing a stronger failure detector, called ordered perfect, or restricting the general nature of predicates.