Naming symmetric processes using shared variables

SummaryImplementations 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.

[1]  Nir Shavit,et al.  Bounded polynomial randomized consensus , 1989, PODC.

[2]  James E. Burns.  Symmetry in systems of asynchronous processes , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[3]  Maurice Herlihy,et al.  Fast Randomized Consensus Using Shared Memory , 1990, J. Algorithms.

[4]  LamportLeslie.  Time, clocks, and the ordering of events in a distributed system , 1978 .

[5]  Maurice Herlihy,et al.  Wait-free synchronization , 1991, TOPL.

[6]  L. Lim,et al.  Solving the processor identity problem in O(n) space , 1990, Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing 1990.

[7]  Baruch Schieber,et al.  Calling names in nameless networks , 1989, PODC '89.

[8]  Boaz Patt-Shamir,et al.  The Las-Vegas processor identity problem (how and when to be unique) , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.

[9]  Ralph E. Johnson,et al.  Symmetry and similarity in distributed systems , 1985, PODC '85.

[10]  Richard Cole,et al.  The APRAM: incorporating asynchrony into the PRAM model , 1989, SPAA '89.

[11]  Baruch Schieber,et al.  Calling Names on Nameless Networks , 1994, Inf. Comput..

[12]  Alon Itai,et al.  Symmetry breaking in distributive networks , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[13]  Hagit Attiya,et al.  Achievable cases in an asynchronous environment , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[14]  Dana Angluin,et al.  Local and global properties in networks of processors (Extended Abstract) , 1980, STOC '80.

[15]  Danny Dolev,et al.  Choice coordination with bounded failure (a preliminary version) , 1985, PODC '85.

[16]  James H. Anderson,et al.  The Virtue of Patience: Concurrent Programming with and Without Waiting , 1990 .

[17]  Daniel Lehmann,et al.  On the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem , 1981, POPL '81.

[18]  Danny Dolev,et al.  Choice coordination with limited failure , 2005, Distributed Computing.

[19]  Shang-Hua Teng.  Space Efficient Processor Identity Protocol , 1990, Inf. Process. Lett..

[20]  Masafumi Yamashita,et al.  Computing on an anonymous network , 1988, PODC '88.

[21]  Nir Shavit,et al.  Atomic snapshots of shared memory , 1990, PODC '90.

[22]  Yossi Matias,et al.  Simple and Efficient Election Algorithms for Anonymous Networks , 1989, WDAG.

[23]  Leslie Lamport,et al.  On interprocess communication , 1986, Distributed Computing.

[24]  K. Mani Chandy,et al.  Parallel program design - a foundation , 1988 .

[25]  Edsger W. Dijkstra,et al.  Solution of a problem in concurrent programming control , 1965, CACM.

[26]  Arvin Park,et al.  The Processor Identity Problem , 1990, Inf. Process. Lett..

[27]  Michael O. Rabin,et al.  The choice coordination problem , 1982, Acta Informatica.

[28]  K. Mani Chandy,et al.  The drinking philosophers problem , 1984, ACM Trans. Program. Lang. Syst..

[29]  K. Mani Chandy.  Parallel program design , 1989 .

[30]  Amos Israeli,et al.  On processor coordination using asynchronous hardware , 1987, PODC '87.

[31]  Karl R. Abrahamson.  On achieving consensus using a shared memory , 1988, PODC '88.

[32]  James H. Anderson,et al.  Composite registers , 1990, PODC '90.

[33]  Alon Itai,et al.  Symmetry breaking in distributed networks , 1990, Inf. Comput..

[34]  Zohar Manna,et al.  How to cook a temporal proof system for your pet language , 1983, POPL '83.

[35]  Edsger W. Dijkstra,et al.  Hierarchical ordering of sequential processes , 1971, Acta Informatica.