Tight bounds for shared memory systems accessed by Byzantine processes

DOI10.1007/S00446-005-0125-8MaRDI QIDQ1953641zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Noga Alon, Michael Merritt, Omer Reingold, Gadi Taubenfeld

Publication date 7 June 2013

Published in Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00446-005-0125-8

zbMATH Keywords

Byzantine agreementdistributed consensuskeywords shared memorysticky bits

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Network design and communication in computer systems (68M10) Distributed systems (68M14)

Recommendations

• scientific article; zbMATH DE number 2013833
• Reliable shared memory abstraction on top of asynchronous Byzantine message-passing systems
• Byzantine disk paxos: optimal resilience with Byzantine shared memory
• Byzantine disk paxos
• scientific article; zbMATH DE number 1696685

Cites work

• scientific article; zbMATH DE number 1696685 (Why is no real title available?)
• scientific article; zbMATH DE number 830463 (Why is no real title available?)
• A simple proof of a simple consensus algorithm
• An Optimistic Approach to Lock-Free FIFO Queues
• Computing with faulty shared objects
• Contention in shared memory algorithms
• Fault-tolerant wait-free shared objects
• Impossibility of distributed consensus with one faulty process
• On the space complexity of randomized synchronization
• Randomized wait-free concurrent objects (extended abstract)
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• Wait-free Byzantine consensus.

Cited in

(7)

• scientific article; zbMATH DE number 1696685 (Why is no real title available?)
• Objects shared by Byzantine processes
• Bounded memory protocols
• scientific article; zbMATH DE number 2013833 (Why is no real title available?)
• Relationships Between Broadcast and Shared Memory in Reliable Anonymous Distributed Systems
• Bounds on shared memory for mutual exclusion
• Generalized pseudorandom secret sharing and efficient straggler-resilient secure computation

Describes a project that uses

Uses Software

• JSR-166

This page was built for publication: Tight bounds for shared memory systems accessed by Byzantine processes

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