Computing with faulty shared objects
From MaRDI portal
Publication:4369897
DOI10.1145/227683.227688zbMath0890.68019OpenAlexW1986678900MaRDI QIDQ4369897
Gadi Taubenfeld, Yehuda Afek, Michael Merritt, David S. Greenberg
Publication date: 28 January 1998
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/227683.227688
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computer system organization (68M99)
Related Items (10)
Efficient test \& set constructions for faulty shared memory ⋮ Byzantine disk paxos: optimal resilience with Byzantine shared memory ⋮ Randomized registers and iterative algorithms ⋮ Active disk Paxos with infinitely many processes ⋮ Tight bounds for shared memory systems accessed by Byzantine processes ⋮ Objects shared by Byzantine processes ⋮ Hundreds of impossibility results for distributed computing ⋮ Randomized protocols for asynchronous consensus ⋮ Recoverable mutual exclusion ⋮ The power of multiobjects.
This page was built for publication: Computing with faulty shared objects