In the Iterated Immediate Snapshot model (IIS) the memory consists of a sequence of one-shot Immediate Snapshot (IS) objects. Processes access the sequence of objects, one-by-one, asynchronously, in a wait-free manner; any number of processes can crash. Its interest lies in the elegant recursive structure of its runs, hence of the ease to analyze it round by round. In a very interesting way, Borowsky and Gafni have shown that the IIS model and the read/write model are equivalent for the wait-free solvability of decision tasks. This paper extends the benefits of the IIS model to partially synchronous systems. Given a shared memory model enriched with a failure detector, what is an equivalent IIS model? The paper shows that an elegant way of capturing the power of a failure detector and other partially synchronous systems in the IIS model is by restricting appropriately its set of runs, giving rise to the Iterated Restricted Immediate Snapshot model (IRIS). © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Rajsbaum, S., Raynal, M., & Travers, C. (2008). The iterated restricted immediate snapshot model. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5092 LNCS, pp. 487–497). https://doi.org/10.1007/978-3-540-69733-6_48
Mendeley helps you to discover research relevant for your work.