On the importance of having an identity or, is consensus really universal?

DOI10.1007/s00446-005-0121-zzbMath1264.68026arXivcs/0201006OpenAlexW2567788443MaRDI QIDQ1953645

Harry Buhrman, Riccardo Silvestri, Alessandro Panconesi

Publication date: 7 June 2013

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0201006

Mathematics Subject Classification ID

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

Related Items (9)

Anonymous Processors with Synchronous Shared Memory: Monte Carlo Algorithms ⋮ Byzantine agreement with homonyms in synchronous systems ⋮ Uniform reliable broadcast in anonymous distributed systems with fair lossy channels ⋮ Anonymous and fault-tolerant shared-memory computing ⋮ The computational power of population protocols ⋮ The Synchronization Power of Coalesced Memory Accesses ⋮ Efficient randomized test-and-set implementations ⋮ Unnamed Item ⋮ Byzantine agreement with homonyms

Cites Work

• The processor identity problem
• Computing in totally anonymous asynchronous shared memory systems
• Polylog randomized wait-free consensus
• Lower bounds for distributed coin-flipping and randomized consensus
• Fast randomized consensus using shared memory
• Unreliable failure detectors for reliable distributed systems
• The weakest failure detector for solving consensus
• Robust wait-free hierarchies
• The Las-Vegas Processor Identity Problem (How and When to Be Unique)
• Time- and Space-Efficient Randomized Consensus
• Randomized Consensus in Expected $O(N\log ^2 N)$ Operations Per Processor
• The asynchronous computability theorem for t-resilient tasks
• Efficient asynchronous consensus with the weak adversary scheduler
• Immediate atomic snapshots and fast renaming

This page was built for publication: On the importance of having an identity or, is consensus really universal?