Skip to main content
SpringerLink
Log in

Naming symmetric processes using shared variables

  • Published:
Distributed Computing Aims and scope Submit manuscript

Summary

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abrahamson K: On achieving consensus using a shared memory. Proceedings of the 7th ACM symposium on principles of distributed computing 1988, pp 291–302

  2. Afek Y, Attiya H, Dolev D, Gafni E, Merritt M, Shavit N: Atomic snapshots of shared memory. Proceedings of the 9th ACM Symposium on Principles of Distributed Computing, 1990, pp 1–14

  3. Anderson JH, Gouda MG: The virtue of patience: concurrent programming with and without waiting. Tech Rep TR.90.23, Department of Computer Sciences, University of Texas at Austin, 1990.

  4. Anderson JH: Composite registers. Proceedings of the 9th ACM Symposium on Principles of Distributed Computing, 1990, pp 15–30

  5. Angluin D: Local and global properties in networks of processors. Proceedings of the 12th ACM Symposium on Theory of Computing, 1980, pp 82–93

  6. Aspnes J, Herlihy M: Fast randomized consensus using shared memory. J Algorithms 11(3): 441–461 (1990)

    Google Scholar 

  7. Attiya H, Bar-Noy A, Dolev D, Koller D, Peleg D, Reischuk R: Achievable cases in an asynchronous environment. Proceedings of the 28th Symposium on Foundations of Computer Science, 1987, pp 337–346

  8. Attiya H, Dolev D, Shavit N: Bounded polynomial randomized consensus. 8th ACM Symposium on Principles of Distributed Computing, 1989, pp 281–294

  9. Bar-Noy A, Ben-Or M, Dolev D: Choice-coordination with bounded failure. Distrib Comput 3(2): 61–72 (1989)

    Google Scholar 

  10. Burns JE: Symmetry in systems of asynchronous processes. Proceedings of the 22nd Symposium on Foundations of Computer Science, 1981, pp 169–174

  11. Chandy KM, Misra J: The drinking philosophers problem. ACM Trans Program Lang Syst 6(4): 632–646 (1984)

    Google Scholar 

  12. Chandy KM, Misra J:Parallel program design: a foundation. Addison Wesley, 1988

  13. Chor B, Israeli A, Li M: On processor-coordination using asynchronous hardwave. Proceedings of the 6th ACM Symposium on Principles of Distributed Computing, 1987, pp 86–97

  14. Cole R, Zajicek O: The APRAM: incorporating asynchrony into the PRAM model. Proceedings of the 1989 ACM Symposium on Parallel Algorithms and Architectures, 1989, pp 169–178

  15. Dijkstra EW: Solution of a problem in concurrent programming control. Commun ACM 8(9): 569 (1965)

    Google Scholar 

  16. Dijkstra EW: Hierarchical ordering of sequential processes. Acta Inf 1: 115–138 (1971)

    Google Scholar 

  17. Herlihy M: Wait-free synchronization. ACM Trans Program Lang Syst 13(1): 124–149 (1991)

    Google Scholar 

  18. Itai A, Rodeh M: Symmetry breaking in distributed networks. Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981, pp 150–158

  19. Johnson RE, Schneider FB: Symmetry and similarity in distributed systems. Proceedings of the 4th Annual ACM Symposium on Principles of Distributed Computing, 1985, pp 13–22

  20. Kutten S, Ostrovsky R, Patt-Shamir B: The Las-Vegas processor identity problem. Proceedings of Israel Symposium on Theory of Computing and Systems, 1993

  21. Lamport L: Time, clock, and the ordering of events in a distributed system. Commun ACM 21(7): 558–565 (1978)

    Google Scholar 

  22. Lamport L: On interprocess communication, parts I and II. Distrib Comput 1(2): 77–101 (1986)

    Google Scholar 

  23. Lehmann D, Rabin MO: On advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem. Proceedings of the 8th Annual ACM Symposium on Principles of Programming Languages, 1981, 122–138

  24. Lim L, Park A: Solving the processor identity problem inO(n) space. 2nd IEEE Symposium on Parallel and Distributed Computing, 1990

  25. Lipton RJ, Park A: The processor identity problem. Inf Process Lett 36: 91–94 (1990)

    Google Scholar 

  26. Matias Y, Afek Y: Simple and efficient election algorithms for anonymous networks. Proceedings of the 3rd International Workshop on Distributed Algorithms, 1989, pp 183–194

  27. Pnueli A, Manna Z: How to cook a temporal proof system for your pet language. Proceedings of the 9th ACM Symposium on Principles of Programming Languages, 1983, 141–154

  28. Rabin MO: The choice coordination problem. Acta Inf 17: 121–134 (1982)

    Google Scholar 

  29. Scheiber B, Snir M: Calling names on nameless networks. Proceedings of the 8th Annual ACM Symposium on Principles of Distributed Computing, 1989, pp 319–328

  30. Teng S: Space efficient processor identity protocol. Inf Process Lett 34: 147–154 (1990)

    Google Scholar 

  31. Yamashita M, Kameda T: Computing on anonymous networks. Proceedings of the 7th Annual ACM Symposium on Principles of Distributed Computing, 1988, pp 117–130

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of California at Santa Barbara, 93106, Santa Barbara, CA, USA

    Ömer Eğecioğlu & Ambuj K. Singh

Authors
  1. Ömer Eğecioğlu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ambuj K. Singh
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Ömer Eğecioğlu obtained his Ph.D. degree in mathematics from the University of California, San Diego in 1984. At present he is an Associate Professor in the Computer Science department of the University of California, Santa Barbara, where he has been on the faculty since 1985. His principal areas of research are parallel algorithms, bijective and enumerative combinatorics, and combinatorial algorithms. His current interest in parallel algorithms involve approximation and numerical techniques on distributed memory systems while his combinatorial interests center around computational geometry, bijective methods, and ranking algorithms for combinatorial structures.

Ambuj K. Singh is an Assistant Professor in the Department of Computer Science at the University of California, Santa Barbara. He received a Ph.D. in Computer Science from the University of Texas at Austin in 1989, an M.S. in Computer Science from Iowa State University in 1984, and a B. Tech. from the Indian Institute of Technology at Kharagpur in 1982. His research interests are in the areas of adaptive resource allocation, concurrent program development, and distributed shared memory.

Work supported in part by NSF grants CCR-9008628 and CCR-9223094

Rights and permissions

Reprints and permissions

About this article

Cite this article

Eğecioğlu, Ö., Singh, A.K. Naming symmetric processes using shared variables. Distrib Comput 8, 19–38 (1994). https://doi.org/10.1007/BF02283568

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02283568

Key words

Search

Navigation