Naming symmetric processes using shared variables

Authors:
Ömer Eǧecioǧlu;Ambuj K. Singh
Affiliations:
Department of Computer Science, University of California at Santa Barbara, Santa Barbara, CA;Department of Computer Science, University of California at Santa Barbara, Santa Barbara, CA
Venue:
Distributed Computing
Year:
1994

Citing 22
Cited 6

The drinking philosophers problem

ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
On processor coordination using asynchronous hardware

PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Parallel program design: a foundation

Parallel program design: a foundation
Computing on an anonymous network

PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
On achieving consensus using a shared memory

PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
The APRAM: incorporating asynchrony into the PRAM model

SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Bounded polynomial randomized consensus

Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Calling names in nameless networks

Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Space efficient processor identity protocol

Information Processing Letters
Fast randomized consensus using shared memory

Journal of Algorithms
The processor identity problem

Information Processing Letters
Atomic snapshots of shared memory

PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Composite registers

PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Wait-free synchronization

ACM Transactions on Programming Languages and Systems (TOPLAS)
Symmetry and similarity in distributed systems

Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Time, clocks, and the ordering of events in a distributed system

Communications of the ACM
Solution of a problem in concurrent programming control

Communications of the ACM
How to cook a temporal proof system for your pet language

POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
On the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem

POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Simple and Efficient Election Algorithms for Anonymous Networks

Proceedings of the 3rd International Workshop on Distributed Algorithms
Local and global properties in networks of processors (Extended Abstract)

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
The Virtue of Patience: Concurrent Programming with and Without Waiting

The Virtue of Patience: Concurrent Programming with and Without Waiting

Torus orientation

Distributed Computing
Randomized naming using wait-free shared variables

Distributed Computing
Relationships between broadcast and shared memory in reliable anonymous distributed systems

Distributed Computing - Special issue: DISC 04
The anonymous consensus hierarchy and naming problems

OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
What can be implemented anonymously?

DISC'05 Proceedings of the 19th international conference on Distributed Computing
On the power of anonymous one-way communication

OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Implementations of inter-process communication and synchronization in distributed systems usually rely on the existence of unique ids for the processes. We consider the problem of generating such ids for identical processes in a shared-variable system. A randomized protocol that assigns distinct ids to the processes within an expected polynomial number of rounds using a polynomial number of boolean atomic variables is presented.