Complexity of network synchronization
Journal of the ACM (JACM)
Reliable communication in the presence of failures
ACM Transactions on Computer Systems (TOCS)
Consistent detection of global predicates
PADD '91 Proceedings of the 1991 ACM/ONR workshop on Parallel and distributed debugging
Local and temporal predicates in distributed systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
Introduction to Distributed Algorithms
Introduction to Distributed Algorithms
Global States and Time in Distributed Systems
Global States and Time in Distributed Systems
Detection of Global State Predicates
WDAG '91 Proceedings of the 5th International Workshop on Distributed Algorithms
(Im)Possibilities of Predicate Detection in Crash-Affected Systems
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
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)
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
A Modular Approach to Fault-Tolerant Broadcasts and Related Problems
A Modular Approach to Fault-Tolerant Broadcasts and Related Problems
Detection of global predicates: techniques and their limitations
Distributed Computing
On termination detection in crash-prone distributed systems with failure detectors
Journal of Parallel and Distributed Computing
SSS'07 Proceedings of the 9h 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)
| Hi-index | 0.00 |
This paper investigates the amount of information about failures needed to solve the predicate detection problem in asynchronous systems with crash failures. In particular, we show that predicate detection cannot be solved with traditional failure detectors, which are only functions of failures. In analogy to the definition of failure detectors, we define a failure detection sequencer, which can be regarded as a generalization of a failure detector. More specifically, our failure detection sequencer 驴 outputs information about failures and about the final state of the crashed process. We show that 驴 is necessary and sufficient to solve predicate detection. Moreover, 驴 can be implemented in synchronous systems. Finally, we relate sequencers to perfect failure detectors and characterize the amount of knowledge about failures they additionally offer.