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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aspnes J: Time- and space-efficient randomized consensus. J Algorithms 14(3):414-431 (1993)
Aspnes J: Lower bounds for distributed coin-flipping and randomized consensus. J Assoc Comput Machin 45(3):415-450 (1998)
Aspnes J, Herlihy M: Fast randomized consensus using shared memory, J Algorithms 11(3):441-461 (1990)
Aspnes J, Waarts O: Randomized consensus in O(n log n) operations per processor. SIAM J Comput 25(5):1024-1044 (1996)
Attiya A, Gorbach ♣, Moran S: Computing in totally anonymous shared memory systems, DISC 98. LNCS 1499, pp. 49–61
Attiya H, Welch EJ: Distributed Computing, McGraw-Hill
Aumann Y: Efficient Asynchronous Consensus with the Weak Adversary Scheduler, In: Proceedings of the 16th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 1997), pp. 209-218
Bar-Noy A, Dolev D: Shared Memory vs. Message-passing in an Asynchronous Distributed Environment. In: Proceedings of the 8th ACM Symposium on Principles of Distributed Computing, 1989, pp. 307-318
Borowsky E, Gafni E: Immediate Atomic Snapshots and Fast Renaming. In: Proceedings of the 12th ACM Symposium on Principles of Distributed Computing, 1993, pp. 41-52
Chandra TD: Polylog Randomized Wait-Free Consensus. In: Proceedings of the 15th ACM SIGACT-SIGOPS. Symposium on Principles of Distributed Computing (PODC 1996)
Chandra TD, Hadzilacos V, Toueg S: The weakest failure detector for solving Consensus. J ACM 43(4):685-722 (1996)
Chandra TD, Toueg S: Unreliable failure detectors for reliable distributed systems. J ACM 43(2):225-267 (1996)
Herlihy M: Wait-Free Synchronization. Preliminary version in Proceedings of the 7th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 1988)
Herlihy M, Shavit N: The Asynchronous Computability Theorem for t-Resilient Tasks. In: Proc. 25th ACM Symp. Theory of Computing, 1993, pp. 111-120
Jayanti P: Robust wait-free hierarchies. J ACM 44(4):592-614 (1997)
Jayanti P, Toueg S: Wake-up under read/write atomicity, WDAG 1990, LNCS 486, pp. 277-288
Kutten S, Ostrovsky R, Patt-Shamir B: The Las-Vegas Processor Identity Problem (How and When to Be Unique). Proceedings of the 1st Israel Symposium on Theory of Computing and Systems, 1993
Lipton RJ, Park A: Solving the processor identity problem in O(n) space. Inform Process Lett 36, 91-94 (1990)
Wai-Kau Lo, Hadzilacos V: Using Failure Detectors to Solve Consensus in Asynchronous Shared-Memory Systems. Proceedings of the 8th International Workshop on Distributed Algorithms. Terschelling, The Netherlands, September-October 1994, pp. 280-295
Lynch N: Distributed Algorithms, Morgan Kaufmann
Panconesi A, Papatriantafilou M, Tsigas P, Vitanyi P: Randomized naming using wait-free shared variables. Distrib Comput 11:113-124 (1998)
Pogosyants A, Segala R, Lynch N: Verification of the Randomized Consensus Algorithm of Aspnes and Herlihy: a Case Study. MIT Technical Memo number MIT/LCS/TM-555, June 1997
Author information
Authors and Affiliations
Additional information
Received: 24 January 2002, Revised: 15 October 2002, Accepted: 19 November 2004, Published online: 10 March 2005
Rights and permissions
About this article
Cite this article
Buhrman, H., Panconesi, A., Silvestri, R. et al. On the importance of having an identity or, is consensus really universal?. Distrib. Comput. 18, 167–176 (2006). https://doi.org/10.1007/s00446-005-0121-z
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00446-005-0121-z