k-Immediate Snapshot and x-Set Agreement: How Are They Related?

DOI10.1007/978-3-030-64348-5_8MaRDI QIDQ6487899zbMATH OpenFDO

Authors Carole Delporte, Hugues Fauconnier, Sergio Rajsbaum, Michel Raynal

Publication date 21 March 2023

Mathematics Subject Classification ID

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

Recommendations

• Distributed computability: relating \(k\)-immediate snapshot and \(x\)-set agreement
• \(t\)-resilient immediate snapshot Is impossible
• Untangling partial agreement: iterated \(x\)-consensus simulations
• Atomic snapshots using lattice agreement
• A non-topological proof for the impossibility of \(k\)-set agreement

Cited in

(5)

• Set-constrained delivery broadcast: a communication abstraction for read/write implementable distributed objects
• Untangling partial agreement: iterated \(x\)-consensus simulations
• \(t\)-resilient immediate snapshot Is impossible
• Distributed computability: relating \(k\)-immediate snapshot and \(x\)-set agreement
• The Iterated Restricted Immediate Snapshot Model

This page was built for publication: k-Immediate Snapshot and x-Set Agreement: How Are They Related?

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