Parallel program design: a foundation
Parallel program design: a foundation
Unifying self-stabilization and fault-tolerance
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
On FTSS-solvable distributed problems
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Consistent global states of distributed systems: fundamental concepts and mechanisms
Distributed systems (2nd Ed.)
Elements of distributed computing
Elements of distributed computing
Global States and Time in Distributed Systems
Global States and Time in Distributed Systems
Tolerating transient and intermittent failures
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
Tolerating Transient and Permanent Failures (Extended Abstract)
WDAG '93 Proceedings of the 7th International Workshop on Distributed Algorithms
DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
(Im)Possibilities of Predicate Detection in Crash-Affected Systems
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
Distributed Predicate Detection in a Faulty Environment
ICDCS '98 Proceedings of the The 18th International Conference on Distributed Computing Systems
Dining Philosophers that Tolerate Malicious Crashes
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
A Fine-Grained Modality Classification for Global Predicates
IEEE Transactions on Parallel and Distributed Systems
Introduction to Reliable Distributed Programming
Introduction to Reliable Distributed Programming
| Hi-index | 0.00 |
We study the problem of global predicate detection in presence of permanent and transient failures. We term the transient failures as small faults. We show that it is impossible to detect predicates in an asynchronous distributed system prone to small faults even if nodes are equipped with a powerful device known as failure detector sequencer (denoted by Σ). To redress this impossibility, we introduce a theoretical device, known as a small fault sequencer (denoted by ΣSF), and show that ΣSF is necessary and sufficient for predicate detection. Unfortunately, we also show that ΣSF cannot be implemented even in a synchronous distributed system. Fortunately, however, we show that predicate detection can be achieved with high probability in synchronous systems.