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

Authors:
Harry Buhrman;Alessandro Panconesi;Riccardo Silvestri;Paul Vitanyi
Affiliations:
CWI, Amsterdam, The Netherlands;Dipartimento di Informatica, Unversità La Sapienza di Roma, Roma, Italy;Dipartimento di Informatica, Unversità La Sapienza di Roma, Roma, Italy;CWI, Amsterdam, The Netherlands
Venue:
Distributed Computing - Special issue: DISC 04
Year:
2006

Citing 20
Cited 12

Impossibility and universality results for wait-free synchronization

PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Shared-memory vs. message-passing in an asynchronous distributed environment

Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Fast randomized consensus using shared memory

Journal of Algorithms
The processor identity problem

Information Processing Letters
Time- and space-efficient randomized consensus

Journal of Algorithms
Immediate atomic snapshots and fast renaming

PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
The asynchronous computability theorem for t-resilient tasks

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Unreliable failure detectors for reliable distributed systems

Journal of the ACM (JACM)
The weakest failure detector for solving consensus

Journal of the ACM (JACM)
Randomized Consensus in Expected O(n log^ 2 n) Operations Per Processor

SIAM Journal on Computing
Polylog randomized wait-free consensus

PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Efficient asynchronous consensus with the weak adversary scheduler

PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Robust wait-free hierarchies

Journal of the ACM (JACM)
Lower bounds for distributed coin-flipping and randomized consensus

Journal of the ACM (JACM)
Distributed Algorithms

Distributed Algorithms
Wakeup under Read/Write Atomicity

WDAG '90 Proceedings of the 4th International Workshop on Distributed Algorithms
Using Failure Detectors to Solve Consensus in Asynchronous Sharde-Memory Systems (Extended Abstract)

WDAG '94 Proceedings of the 8th International Workshop on Distributed Algorithms
Computing in Totally Anonymous Asynchronous Shared Memory Systems

DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
Verification of the Randomized Consensus Algorithm of Aspnes and Herlihy: a Case Study

Verification of the Randomized Consensus Algorithm of Aspnes and Herlihy: a Case Study
Randomized naming using wait-free shared variables

Distributed Computing

The Synchronization Power of Coalesced Memory Accesses

DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Non-blocking programming on multi-core graphics processors: (extended asbtract)

ACM SIGARCH Computer Architecture News
The anonymous consensus hierarchy and naming problems

OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Brief announcement: byzantine agreement with homonyms

Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
The price of anonymity: optimal consensus despite asynchrony, crash and anonymity

DISC'09 Proceedings of the 23rd international conference on Distributed computing
Byzantine agreement with homonyms

Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
The Price of Anonymity: Optimal Consensus Despite Asynchrony, Crash, and Anonymity

ACM Transactions on Autonomous and Adaptive Systems (TAAS)
On the power of anonymous one-way communication

OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Anonymous agreement: the janus algorithm

OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Byzantine agreement with homonyms in synchronous systems

ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
Homonyms with forgeable identifiers

SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Byzantine agreement with homonyms in synchronous systems

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that Naming - the existence of distinct IDs known to all - is a hidden, but necessary, assumption of Herlihy's universality result for Consensus. We then show in a very precise sense that Naming is harder than Consensus and bring to the surface some relevant differences existing between popular shared memory models.