Immediate atomic snapshots and fast renaming
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)
A simple algorithmically reasoned characterization of wait-free computation (extended abstract)
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
An impossibility about failure detectors in the iterated immediate snapshot model
Information Processing Letters
The Iterated Restricted Immediate Snapshot Model
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Increasing the power of the iterated immediate snapshot model with failure detectors
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
| Hi-index | 0.00 |
This short paper shows how to capture failure detectors so that the base asynchronous read/wite model and the distributed iterated model have the same computational power when both are enriched with the same failure detector. To that end it introduces the notion of a "strongly correct" process and presents simulations that prove the computational equivalence when both models are enriched with the same failure detector. Interestingly, these simulations, which work for a large family of failure detector classes, can be easily extended to the case where the wait-freedom requirement is replaced by the notion of t-resilience. A noteworthy and first class feature of the proposed approach lies in its simplicity.