The Iterated Restricted Immediate Snapshot Model

DOI10.1007/978-3-540-69733-6_48zbMath1148.68330OpenAlexW1538367796MaRDI QIDQ3511360

Michel Raynal, Sergio Rajsbaum, Corentin Travers

Publication date: 10 July 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69733-6_48

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (13)

Collapsibility of read/write models using discrete Morse theory ⋮ Unnamed Item ⋮ A Separation of n-consensus and (n + 1)-consensus Based on Process Scheduling ⋮ Power and limits of distributed computing shared memory models ⋮ The solvability of consensus in iterated models extended with safe-consensus ⋮ Partial synchrony based on set timeliness ⋮ Failure detectors encapsulate fairness ⋮ The Iterated Restricted Immediate Snapshot Model ⋮ An Introduction to the Topological Theory of Distributed Computing with Safe-consensus ⋮ An impossibility about failure detectors in the iterated immediate snapshot model ⋮ Untangling Partial Agreement: Iterated x-consensus Simulations ⋮ A topological perspective on distributed network algorithms ⋮ t-Resilient Immediate Snapshot Is Impossible

Cites Work

• Anti-\(\Omega \): the weakest failure detector for set agreement
• More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
• Tight bounds for \(k\)-set agreement with limited-scope failure detectors
• Unifying synchronous and asynchronous message-passing models
• Round-by-round fault detectors (extended abstract)
• Structured derivations of consensus algorithms for failure detectors
• The topological structure of asynchronous computability
• The Iterated Restricted Immediate Snapshot Model
• Subconsensus Tasks: Renaming Is Weaker Than Set Agreement
• Complexity of network synchronization
• Atomic snapshots of shared memory
• Sharing memory robustly in message-passing systems
• Unreliable failure detectors for reliable distributed systems
• The weakest failure detector for solving consensus
• Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
• Irreducibility and additivity of set agreement-oriented failure detector classes
• Timeliness, failure-detectors, and consensus performance
• Generalized FLP impossibility result for t-resilient asynchronous computations
• A simple algorithmically reasoned characterization of wait-free computation (extended abstract)
• Immediate atomic snapshots and fast renaming
• Distributed Computing
• Failure detectors are schedulers

This page was built for publication: The Iterated Restricted Immediate Snapshot Model