Understanding the set consensus partial order using the Borowsky-Gafni simulation (extended abstract)

DOI10.1007/3-540-61769-8_23MaRDI QIDQ6570929zbMATH OpenFDO

Authors Soma Chaudhuri, Paul Reiners

Publication date 11 July 2024

Mathematics Subject Classification ID

Distributed systems (68M14)

Recommendations

• The BG distributed simulation algorithm
• Untangling partial agreement: iterated \(x\)-consensus simulations
• Of choices, failures and asynchrony: the many faces of set agreement
• The \(k\)-simultaneous consensus problem
• The multiplicative power of consensus numbers

Cites work

• Atomic snapshots of shared memory
• Impossibility of distributed consensus with one faulty process
• More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
• On the robustness of Herlihy's hierarchy

This page was built for publication: Understanding the set consensus partial order using the Borowsky-Gafni simulation (extended abstract)

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