Advertisement

Distributed Computing

, Volume 18, Issue 3, pp 167–176 | Cite as

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

  • Harry Buhrman
  • Alessandro Panconesi
  • Riccardo Silvestri
  • Paul Vitanyi
Article

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.

Keywords

Operating System Communication Network Computer System System Organization Shared Memory 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aspnes J: Time- and space-efficient randomized consensus. J Algorithms 14(3):414-431 (1993)Google Scholar
  2. 2.
    Aspnes J: Lower bounds for distributed coin-flipping and randomized consensus. J Assoc Comput Machin 45(3):415-450 (1998)Google Scholar
  3. 3.
    Aspnes J, Herlihy M: Fast randomized consensus using shared memory, J Algorithms 11(3):441-461 (1990)Google Scholar
  4. 4.
    Aspnes J, Waarts O: Randomized consensus in O(n log n) operations per processor. SIAM J Comput 25(5):1024-1044 (1996)Google Scholar
  5. 5.
    Attiya A, Gorbach ♣, Moran S: Computing in totally anonymous shared memory systems, DISC 98. LNCS 1499, pp. 49–61Google Scholar
  6. 6.
    Attiya H, Welch EJ: Distributed Computing, McGraw-HillGoogle Scholar
  7. 7.
    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-218Google Scholar
  8. 8.
    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-318Google Scholar
  9. 9.
    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-52Google Scholar
  10. 10.
    Chandra TD: Polylog Randomized Wait-Free Consensus. In: Proceedings of the 15th ACM SIGACT-SIGOPS. Symposium on Principles of Distributed Computing (PODC 1996)Google Scholar
  11. 11.
    Chandra TD, Hadzilacos V, Toueg S: The weakest failure detector for solving Consensus. J ACM 43(4):685-722 (1996)Google Scholar
  12. 12.
    Chandra TD, Toueg S: Unreliable failure detectors for reliable distributed systems. J ACM 43(2):225-267 (1996)Google Scholar
  13. 13.
    Herlihy M: Wait-Free Synchronization. Preliminary version in Proceedings of the 7th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 1988)Google Scholar
  14. 14.
    Herlihy M, Shavit N: The Asynchronous Computability Theorem for t-Resilient Tasks. In: Proc. 25th ACM Symp. Theory of Computing, 1993, pp. 111-120Google Scholar
  15. 15.
    Jayanti P: Robust wait-free hierarchies. J ACM 44(4):592-614 (1997)Google Scholar
  16. 16.
    Jayanti P, Toueg S: Wake-up under read/write atomicity, WDAG 1990, LNCS 486, pp. 277-288Google Scholar
  17. 17.
    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, 1993Google Scholar
  18. 18.
    Lipton RJ, Park A: Solving the processor identity problem in O(n) space. Inform Process Lett 36, 91-94 (1990)Google Scholar
  19. 19.
    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-295Google Scholar
  20. 20.
    Lynch N: Distributed Algorithms, Morgan KaufmannGoogle Scholar
  21. 21.
    Panconesi A, Papatriantafilou M, Tsigas P, Vitanyi P: Randomized naming using wait-free shared variables. Distrib Comput 11:113-124 (1998)Google Scholar
  22. 22.
    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 1997Google Scholar

Copyright information

© Springer-Verlag Berlin/Heidelberg 2005

Authors and Affiliations

  • Harry Buhrman
    • 1
  • Alessandro Panconesi
    • 2
  • Riccardo Silvestri
    • 2
  • Paul Vitanyi
    • 1
  1. 1.CWIAmsterdamThe Netherlands
  2. 2.Dipartimento di InformaticaUnversitá La Sapienza di RomaRomaItaly

Personalised recommendations