Objects shared by Byzantine processes

DOI10.1007/S00446-002-0075-3zbMATH Open1448.68145OpenAlexW1966649196MaRDI QIDQ5138482FDOQ5138482

Authors Dahlia Malkhi, Michael Merritt, Michael K. Reiter, Gadi Taubenfeld

Publication date 4 December 2020

Published in Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00446-002-0075-3

zbMATH Keywords

consensusemulationshared memoryByzantine faults

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1696685
• Implementing sequentially consistent shared objects using broadcast and point-to-point communication
• On the power of shared object types to implement one-resilient consensus
• Fault-tolerant wait-free shared objects
• scientific article; zbMATH DE number 2013833
• Tight bounds for shared memory systems accessed by Byzantine processes
• Reliable shared memory abstraction on top of asynchronous Byzantine message-passing systems
• Two distributed problems involving Byzantine processes
• The behavior of shared objects: Concept, pitfalls, and a new model

Cites work

• Computing with faulty shared objects
• Fault-tolerant wait-free shared objects
• Impossibility of distributed consensus with one faulty process
• More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
• On k -set consensus problems in asynchronous systems

Cited in

(3)

• The behavior of shared objects: Concept, pitfalls, and a new model
• Sharing Objects by Read-Only References
• scientific article; zbMATH DE number 1696685 (Why is no real title available?)

This page was built for publication: Objects shared by Byzantine processes

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