scientific article; zbMATH DE number 7561269

DOI10.4230/LIPICS.DISC.2018.17zbMATH Open1497.68040MaRDI QIDQ5090908FDOQ5090908

Authors: Eli Daian, Giuliano Losa, Yehuda Afek, Eli Gafni 

Publication date: 21 July 2022

Title of this publication is not available (Why is that?)

Recommendations

• Deterministic objects: life beyond consensus
• \(m\)-consensus objects are pretty powerful
• On the viability of the deterministic consensus hierarchy
• Publication:2766890
• Distributed consensus, revisited
• On the power of shared object types to implement one-resilient consensus
• Byzantine Fault Detectors for Solving Consensus
• On the uncontended complexity of consensus
• On the nonexistence of resilient consensus protocols

zbMATH Keywords

distributed algorithmsshared memorywait-freeset consensus

Mathematics Subject Classification ID

Distributed algorithms (68W15) Distributed systems (68M14)

Cites Work

• Impossibility of distributed consensus with one faulty process
• More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
• Generalized FLP impossibility result for t-resilient asynchronous computations
• A completeness theorem for a class of synchronization objects
• Consensus power makes (some) sense! (extended abstract)
• Adaptive wait-free algorithms for lattice agreement and renaming (extended abstract)
• Common2 extended to stacks and unbounded concurrency
• Deterministic Objects
• On the number of objects with distinct power and the linearizability of set agreement objects
• On the use of registers in achieving wait-free consensus
• On the Classification of Deterministic Objects via Set Agreement Power

Cited In (2)

• All of Us Are Smarter than Any of Us: Nondeterministic Wait-Free Hierarchies Are Not Robust
• Determining Consensus Numbers

This page was built for publication:

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