The Iterated Restricted Immediate Snapshot Model

DOI10.1007/978-3-540-69733-6_48MaRDI QIDQ3511360zbMATH OpenOpenAlexFDO

Authors Sergio Rajsbaum, Michel Raynal, 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

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

Recommendations

• An impossibility about failure detectors in the iterated immediate snapshot model
• Failure detectors are schedulers
• Brief announcement: Increasing the power of the iterated immediate snapshot model with failure detectors
• Untangling partial agreement: iterated \(x\)-consensus simulations
• k-Immediate Snapshot and x-Set Agreement: How Are They Related?

Cites work

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

Cited in

(15)

• Power and limits of distributed computing shared memory models
• A topological perspective on distributed network algorithms
• An impossibility about failure detectors in the iterated immediate snapshot model
• Collapsibility of read/write models using discrete Morse theory
• Untangling partial agreement: iterated \(x\)-consensus simulations
• Brief announcement: Increasing the power of the iterated immediate snapshot model with failure detectors
• Failure detectors are schedulers
• t-resilient immediate snapshot Is impossible
• scientific article; zbMATH DE number 7228882 (Why is no real title available?)
• Failure detectors encapsulate fairness
• Partial synchrony based on set timeliness
• The Iterated Restricted Immediate Snapshot Model
• An Introduction to the Topological Theory of Distributed Computing with Safe-consensus
• A separation of \(n\)-consensus and \((n+1)\)-consensus based on process scheduling
• The solvability of consensus in iterated models extended with safe-consensus

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3511360)