ACM Transactions on Programming Languages and Systems (TOPLAS)
Atomic snapshots of shared memory
Journal of the ACM (JACM)
Immediate atomic snapshots and fast renaming
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
More choices allow more faults: set consensus problems in totally asynchronous systems
Information and Computation
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
The weakest failure detector for solving consensus
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
Atomic Snapshots in O (n log n) Operations
SIAM Journal on Computing
The topological structure of asynchronous computability
Journal of the ACM (JACM)
Using Failure Detectors to Solve Consensus in Asynchronous Sharde-Memory Systems (Extended Abstract)
WDAG '94 Proceedings of the 8th International Workshop on Distributed Algorithms
Conditions on input vectors for consensus solvability in asynchronous distributed systems
Journal of the ACM (JACM)
The weakest failure detectors to solve certain fundamental problems in distributed computing
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Distributed Computing
The Alpha of Indulgent Consensus
The Computer Journal
Simultaneous consensus tasks: a tighter characterization of set-consensus
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
Subconsensus tasks: renaming is weaker than set agreement
DISC'06 Proceedings of the 20th international conference on Distributed Computing
DISC'05 Proceedings of the 19th international conference on Distributed Computing
The committee decision problem
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Recursion in distributed computing
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Distributed programming with tasks
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
A survey on some recent advances in shared memory models
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
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.89 |
The Iterated Immediate Snapshot model (IIS) is an asynchronous computation model where processes communicate through a sequence of one-shot Immediate Snapshot (IS) objects. It is known that this model is equivalent to the usual asynchronous read/write shared memory model, for wait-free task solvability. Its interest lies in the fact that its runs are more structured and easier to analyze than the runs in the shared memory model. As the IIS model and the shared memory model are equivalent for wait-free task solvability, a natural question is the following: Are they still equivalent for wait-free task solvability, when they are enriched with the same failure detector? The paper shows that the answer to this question is ''no''.