Relationships between broadcast and shared memory in reliable anonymous distributed systems
Authors:
- 17 October 2005
- journal article
- Published by Springer Nature in Distributed Computing
- Vol. 18 (3) , 209-219
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- What Can Be Implemented Anonymously?Lecture Notes in Computer Science, 2005
- Distributed Computing2004
- Hundreds of impossibility results for distributed computingDistributed Computing, 2003
- Computing in Totally Anonymous Asynchronous Shared Memory SystemsInformation and Computation, 2002
- An Effective Characterization of Computability in Anonymous Networks2001
- On the Importance of Having an Identity or, is Consensus really Universal?2000
- Polylog randomized wait-free consensus1996
- Naming symmetric processes using shared variablesDistributed Computing, 1994
- Linearizability: a correctness condition for concurrent objectsACM Transactions on Programming Languages and Systems, 1990
- Trie memoryCommunications of the ACM, 1960