On the Importance of Having an Identity or is Consensus Really Universal?

Authors:
Harry Buhrman;Alessandro Panconesi;Riccardo Silvestri;Paul M. B. Vitányi
Affiliations:
-;-;-;-
Venue:
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Year:
2000

Citing 19
Cited 6

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
Wakeup under read/write atomicity

Proceedings of the 4th international workshop on Distributed algorithms
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)
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

Wait-free consensus with infinite arrivals

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Randomized two-process wait-free test-and-set

Distributed Computing
Randomized protocols for asynchronous consensus

Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Relationships between broadcast and shared memory in reliable anonymous distributed systems

Distributed Computing - Special issue: DISC 04
What can be implemented anonymously?

DISC'05 Proceedings of the 19th international conference on Distributed Computing
Randomized wait-free consensus using an atomicity assumption

OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that Naming-the existence of distinct IDs known to all- is a 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 important differences existing between popular shared memory models which usually remain unnoticed.