Access the full text.
Sign up today, get DeepDyve free for 14 days.
L. Lamport (1978)
Time, clocks, and the ordering of events in a distributed systemCommun. ACM, 21
A. Bar-Noy, M. Ben-Or, D. Dolev (1989)
Choice coordination with limited failureDistributed Computing, 3
Y. Afek, D. Dolev, H. Attiya, E. Gafni, Michael Merritt, N. Shavit (1990)
Atomic snapshots of shared memory
K. Chandy, J. Misra (1988)
Parallel program design - a foundation
James Anderson (1990)
Composite registersDistributed Computing, 6
Yossi Matias, Y. Afek (1989)
Simple and Efficient Election Algorithms for Anonymous Networks
R. Lipton, A. Park (1990)
The Processor Identity ProblemInf. Process. Lett., 36
M. Yamashita, T. Kameda (1988)
Computing on an anonymous network
M. Rabin (1982)
The choice coordination problemActa Informatica, 17
S. Teng (1990)
Space Efficient Processor Identity ProtocolInf. Process. Lett., 34
S. Kutten, R. Ostrovsky, B. Patt-Shamir (1993)
The Las-Vegas processor identity problem (how and when to be unique)[1993] The 2nd Israel Symposium on Theory and Computing Systems
B. Schieber (1989)
Calling names in nameless networks
J. Aspnes, M. Herlihy (1990)
Fast Randomized Consensus Using Shared MemoryJ. Algorithms, 11
R. Cole, O. Zajicek (1989)
The APRAM: incorporating asynchrony into the PRAM model
Ralph Johnson, F. Schneider (1985)
Symmetry and similarity in distributed systems
H. Attiya, D. Dolev, N. Shavit (1989)
Bounded polynomial randomized consensusProceedings of the eighth annual ACM Symposium on Principles of distributed computing
Z. Manna, A. Pnueli (1983)
How to cook a temporal proof system for your pet language
Sri Palakollu (2020)
Interprocess CommunicationPractical System Programming with C
K. Chandy (1989)
Parallel program design
E. Dijkstra (1965)
Solution of a problem in concurrent programming control
D. Angluin (1980)
Local and global properties in networks of processors (Extended Abstract)
B. Schieber, M. Snir (1994)
Calling Names on Nameless NetworksInf. Comput., 113
K. Chandy, J. Misra (1984)
The drinking philosophers problemACM Transactions on Programming Languages and Systems (TOPLAS), 6
S. Kutten, Rafail Ostrovskyt, Boaz Patt-Shamis (2004)
The Las-Vegas Processor Identity Problem
A. Itai, M. Rodeh (1981)
Symmetry breaking in distributive networks22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)
L. Lim, A. Park (1990)
Solving the processor identity problem in O(n) spaceProceedings of the Second IEEE Symposium on Parallel and Distributed Processing 1990
A. Itai, M. Rodeh (1990)
Symmetry breaking in distributed networksInf. Comput., 88
James Anderson, M. Gouda (1990)
The Virtue of Patience: Concurrent Programming with and Without Waiting
M. Herlihy (1991)
Wait-free synchronizationACM Trans. Program. Lang. Syst., 13
L Lamport (1986)
On interprocess communication, parts I and IIDistrib Comput, 1
D. Lehmann, M. Rabin (1981)
On the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem
E. Dijkstra (1971)
Hierarchical ordering of sequential processesActa Informatica, 1
A Bar-Noy, M Ben-Or, D Dolev (1989)
Choice-coordination with bounded failureDistrib Comput, 3
B. Chor, A. Israeli, Ming Li (1987)
On processor coordination using asynchronous hardware
H. Attiya, A. Bar-Noy, D. Dolev, D. Koller, D. Peleg, R. Reischuk (1987)
Achievable cases in an asynchronous environment28th Annual Symposium on Foundations of Computer Science (sfcs 1987)
J. Burns (1981)
Symmetry in systems of asynchronous processes22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)
Karl Abrahamson (1988)
On achieving consensus using a shared memory
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.
Distributed Computing – Springer Journals
Published: Dec 6, 2005
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.