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

Distributed Computing

Volumn 18, Issue 3, 2006, Pages 167-176

  Buhrman, Harry ^a   Panconesi, Alessandro ^b   Silvestri, Riccardo ^b   Vitanyi, Paul ^a  

^a CWI   (Netherlands)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STORAGE EQUIPMENT; MATHEMATICAL MODELS;

CONSENSUS; NAMING; SHARED MEMORY;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 32844461160     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00446-005-0121-z     Document Type: Article

References (22)

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