Relationships between broadcast and shared memory in reliable anonymous distributed systems

DOI10.1007/S00446-005-0145-4MaRDI QIDQ1953650zbMATH OpenOpenAlexFDO

Authors James Aspnes, Faith E. Fich, Eric Ruppert

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-0145-4

zbMATH Keywords

robustnesssimulationsbroadcastshared memoryanonymous

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14)

Recommendations

• Relationships Between Broadcast and Shared Memory in Reliable Anonymous Distributed Systems
• Distributed Computing
• Anonymous and fault-tolerant shared-memory computing
• Computing in totally anonymous asynchronous shared memory systems
• Anonymous asynchronous systems: the case of failure detectors

Cites work

• scientific article; zbMATH DE number 1696671 (Why is no real title available?)
• scientific article; zbMATH DE number 3813704 (Why is no real title available?)
• scientific article; zbMATH DE number 1179121 (Why is no real title available?)
• scientific article; zbMATH DE number 2006642 (Why is no real title available?)
• scientific article; zbMATH DE number 1555924 (Why is no real title available?)
• Comparison of initial conditions for distributed algorithms on anonymous networks
• Computing anonymously with arbitrary knowledge
• Computing in totally anonymous asynchronous shared memory systems
• Distributed Computing
• Polylog randomized wait-free consensus
• Probabilistic parallel prefix computation
• Relationships Between Broadcast and Shared Memory in Reliable Anonymous Distributed Systems
• Robust wait-free hierarchies
• Solvability of Consensus: Composition Breaks Down for NonDeterministic Types
• Space efficient processor identity protocol
• The Las-Vegas Processor Identity Problem (How and When to Be Unique)
• The processor identity problem
• Wait-free consensus with infinite arrivals

Cited in

(11)

• Anonymous and fault-tolerant shared-memory computing
• Byzantine agreement with homonyms
• Wait-free solvability of colorless tasks in anonymous shared-memory model
• scientific article; zbMATH DE number 2013828 (Why is no real title available?)
• scientific article; zbMATH DE number 7561451 (Why is no real title available?)
• Relationships Between Broadcast and Shared Memory in Reliable Anonymous Distributed Systems
• Randomized self-stabilizing leader election in preference-based anonymous trees
• scientific article; zbMATH DE number 7515766 (Why is no real title available?)
• Tight bounds for adopt-commit objects
• Reconfigurable broadcast networks and asynchronous shared-memory systems are equivalent
• Anonymous processors with synchronous shared memory: Monte Carlo algorithms

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 Q1953650)