Relationships between broadcast and shared memory in reliable anonymous distributed systems

DOI10.1007/s00446-005-0145-4zbMath1264.68024MaRDI QIDQ1953650

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

robustness; simulations; shared memory; anonymous; broadcast

Mathematics Subject Classification ID

68M10: Network design and communication in computer systems

68M14: Distributed systems

Related Items

RANDOMIZED SELF-STABILIZING LEADER ELECTION IN PREFERENCE-BASED ANONYMOUS TREES, Unnamed Item, Wait-free solvability of colorless tasks in anonymous shared-memory model, Byzantine agreement with homonyms, Tight bounds for adopt-commit objects, Anonymous and fault-tolerant shared-memory computing, Anonymous Processors with Synchronous Shared Memory: Monte Carlo Algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Space efficient processor identity protocol
• The processor identity problem
• Computing in totally anonymous asynchronous shared memory systems
• Probabilistic parallel prefix computation
• Polylog randomized wait-free consensus
• Comparison of initial conditions for distributed algorithms on anonymous networks
• Computing anonymously with arbitrary knowledge
• Wait-free consensus with infinite arrivals
• Solvability of Consensus: Composition Breaks Down for NonDeterministic Types
• Robust wait-free hierarchies
• The Las-Vegas Processor Identity Problem (How and When to Be Unique)
• Distributed Computing
• Relationships Between Broadcast and Shared Memory in Reliable Anonymous Distributed Systems