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 important differences existing between popular shared memory models.
- Pub Date:
- January 2002
- Computer Science - Distributed;
- and Cluster Computing;
- Computer Science - Computational Complexity;
- LaTeX, 15 pages, In: Distributed Computing Conference (DISC'00), Lecture Notes in Computer Science, Vol. 1914, Springer-Verlag, Berlin, 2000, 134--148