Linearizability: a correctness condition for concurrent objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
Space efficient processor identity protocol
Information Processing Letters
The processor identity problem
Information Processing Letters
Wait-free data structures in the asynchronous PRAM model
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
ACM Transactions on Programming Languages and Systems (TOPLAS)
Atomic snapshots of shared memory
Journal of the ACM (JACM)
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Polylog randomized wait-free consensus
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Crowds: anonymity for Web transactions
ACM Transactions on Information and System Security (TISSEC)
Communications of the ACM
Symmetry and similarity in distributed systems
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
The topological structure of asynchronous computability
Journal of the ACM (JACM)
Project “anonymity and unobservability in the Internet”
Proceedings of the tenth conference on Computers, freedom and privacy: challenging the assumptions
The Las-Vegas processor identity problem (how and when to be unique)
Journal of Algorithms
Wait-free consensus with infinite arrivals
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Computing in totally anonymous asynchronous shared memory systems
Information and Computation
Wakeup under Read/Write Atomicity
WDAG '90 Proceedings of the 4th International Workshop on Distributed Algorithms
On the Importance of Having an Identity or is Consensus Really Universal?
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Local and global properties in networks of processors (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Obstruction-Free Synchronization: Double-Ended Queues as an Example
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Computation in networks of passively mobile finite-state sensors
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Randomized naming using wait-free shared variables
Distributed Computing
Distributed Computing
Naming symmetric processes using shared variables
Distributed Computing
Time-space tradeoffs for implementations of snapshots
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Single-scanner multi-writer snapshot implementations are fast!
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Relationships between broadcast and shared memory in reliable anonymous distributed systems
Distributed Computing - Special issue: DISC 04
On the power of anonymous one-way communication
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Anonymous agreement: the janus algorithm
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Enumeration and Leader Election in Partially Anonymous and Multi-hop Broadcast Networks
Fundamenta Informaticae
Efficient distributed snapshots in an anonymous asynchronous message-passing system
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
The vast majority of papers on distributed computing assume that processes are assigned unique identifiers before computation begins. But is this assumption necessary? What if processes do not have unique identifiers or do not wish to divulge them for reasons of privacy? We consider asynchronous shared-memory systems that are anonymous. The shared memory contains only the most common type of shared objects, read/write registers. We investigate, for the first time, what can be implemented deterministically in this model when processes can fail. We give anonymous algorithms for some fundamental problems: timestamping, snapshots and consensus. Our solutions to the first two are wait-free and the third is obstruction-free. We also show that a shared object has an obstruction-free implementation if and only if it satisfies a simple property called idempotence. To prove the sufficiency of this condition, we give a universal construction that implements any idempotent object.