On the power of breakable objects

DOI10.1016/J.TCS.2013.05.036zbMATH Open1360.68209OpenAlexW2142770861MaRDI QIDQ407515FDOQ407515

Authors: Wei Chen, Jialin Zhang, Guangda Hu 

Publication date: 2 September 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.05.036

Recommendations

• Computing with faulty shared objects
• Determining Consensus Numbers
• On the power of shared object types to implement one-resilient consensus
• \(m\)-consensus objects are pretty powerful
• N-Consensus is the Second Strongest Object for N + 1 Processes

zbMATH Keywords

distributed computingshared memorybreakable objectsconsensus numberwait-free hierarchy

Mathematics Subject Classification ID

Distributed systems (68M14)

Cites Work

• Impossibility of distributed consensus with one faulty process
• Less Is More: Consensus Gaps Between Restricted and Unrestricted Objects

Cited In (1)

• Anomalies and similarities among consensus numbers of variously-relaxed queues

This page was built for publication: On the power of breakable objects

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