Relationships Between Broadcast and Shared Memory in Reliable Anonymous Distributed Systems

DOI10.1007/978-3-540-30186-8_19MaRDI QIDQ5464196zbMATH OpenOpenAlexFDO

Authors James Aspnes, Eric Ruppert, Faith E. Fich

Publication date 17 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-30186-8_19

Mathematics Subject Classification ID

Distributed systems (68M14)

Recommendations

• Relationships between broadcast and shared memory in reliable anonymous distributed systems
• Reliable shared memory abstraction on top of asynchronous Byzantine message-passing systems
• Anonymous and fault-tolerant shared-memory computing
• Computing in totally anonymous asynchronous shared memory systems
• Uniform reliable broadcast in anonymous distributed systems with fair lossy channels
• scientific article; zbMATH DE number 7515766
• scientific article; zbMATH DE number 2013833
• Tight bounds for shared memory systems accessed by Byzantine processes

Cited in

(5)

• Relationships between broadcast and shared memory in reliable anonymous distributed systems
• Consensus and collision detectors in radio networks
• scientific article; zbMATH DE number 2013828 (Why is no real title available?)
• scientific article; zbMATH DE number 7515766 (Why is no real title available?)
• Reconfigurable broadcast networks and asynchronous shared-memory systems are equivalent

This page was built for publication: Relationships Between Broadcast and Shared Memory in Reliable Anonymous Distributed Systems

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