Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
article

Randomized naming using wait-free shared variables

Published: 01 August 1998 Publication History

Abstract

A naming protocol assigns unique names (keys) to every process out of a set of communicating processes. We construct a randomized wait-free naming protocol using wait-free atomic read/write registers (shared variables) as process intercommunication primitives. Each process has its own private register and can read all others. The addresses/names each one uses for the others are possibly different: Processes <i>p</i> and <i>q</i> address the register of process <i>r</i> in a way not known to each other. For <i>n</i> processes and ε > 0, the protocol uses a name space of size (1 + ε)<i>n</i> and <i>O</i>(<i>n</i> log <i>n</i> log log <i>n</i>) running time (read/writes to shared bits) with probability at least 1-<i>o</i>(1), and <i>O</i>(<i>n</i>log<sup>2</sup><i>n</i>) overall expected running time. The protocol is based on the wait-free implementation of a novel α-Test&SetOnce object that randomly and fast selects a winner from a set of <i>q</i> contenders with probability at least α in the face of the strongest possible adaptive adversary.

References

[1]
1. Afek Y, Attiya H, Dolev D, Gafni E, Merritt M, Shavit N: Atomic snapshots of shared memory. J Assoc Comput Mach 40:873-890 (1993).
[2]
2. Afek Y, Gafni E, Tromp J, Vitányi PMB: Wait-free test-and-set In Proceedings of the 6th International Workshop on Distributed Algorithms, vol. 647, pp 85-94, Lect Notes Comput Sci, Springer, Berlin Heidelberg New York, 1992.
[3]
3. Anderson J, Composite registers. Distrib Comput 6:141-154 (1993).
[4]
4. Aspnes J, Herlihy M: Fast Randomized Consensus Using Shared Memory. J Algorithms 11:441-461 (1990).
[5]
5. Aspnes J, Waarts O: Randomized Consensus in Expected O(nlog2n) Operations Per Processor, pp 137-146, In Proceedings of FOCS 1992.
[6]
6. Attiya H, Bar-Noy A, Dolev D, Peleg D, Reischuk R: Renaming in an Asynchronous Environment. J Assoc Comput Mach 37:524-548 (1990).
[7]
7. Bar-Noy A, Dolev D: Shared Memory vs. Message-passing in an Asynchronous Distributed Environment. In Proceedings of the 8th ACM Symposium on Principles of Distributed Computing, 1989, pp 307-318.
[8]
8. Borowsky E, Gafni E: Immediate Atomic Snapshots and Fast Renaming. In Proceedings of the 12th ACM Symposium on Principles of Distributed Computing, 1993, pp 41-52.
[9]
9. Buhrman H, Garay JA, Hoepman JH, Moir M: Long-Lived Renaming Made Fast, In Proceedings of the 14th ACM Symposium on Principles of Distributed Computing, 1995, pp 194-203.
[10]
10. Eǧecioǧlu O, Singh AK: Naming Symmetric Processes Using Shared Variables. Distrib Comput 8:1-18 (1994).
[11]
11. Fischer MJ, Lynch NA, Paterson MS: Impossibility of Distributed Consensus with One Faulty Processor. J Assoc Comput Mach 32:374-382 (1985).
[12]
12. Lynch NA: Distributed Algorithms, Morgan Kaufmann, 1996.
[13]
13. Herlihy M: Wait-free synchronization. ACM Trans Progr Lang Syst 13:124-149 (1991).
[14]
14. Herlihy M: Randomized Wait-Free Concurrent Objects. In Proc. 10th ACM Symp. Principles Distrib Comput 1991, pp 11-21.
[15]
15. Herlihy M, Shavit N: The Asynchronous Computability Theorem for t-Resilient Tasks. In Proc. 25th ACM Symp Theory of Computing 1993, pp 111-120.
[16]
16. Kutten S, Ostrovsky R, Patt-Shamir B: The Las-Vegas Processor Identity Problem (How and When to Be Unique). In Proc. 2nd Israel Symp Theor Comput Syst, IEEE Computer Society Press 1993.
[17]
17. Lamport L: On Interprocess Communication. Distrib Comput 1:86-101 (1986).
[18]
18. Li M, Tromp J, Vitányi PMB: How to Share Concurrent Wait-free Variables, J Assoc Comput Math 43:723-746 (1996).
[19]
19. Lipton RJ, Park A: Solving the processor identity problem in O(n) space, Inform Process Lett 36(1990), 91-94.
[20]
20. Loui MC, Abu-Amara HH: Memory Requirements for Agreement Among Unreliable Asynchronous Processes. Advances in Computer Research, Vol. 4, JAI Press, Inc. 1987, pp 163-183.
[21]
21. McDiarmid C: On the method of bounded differences. In Siemons J (ed) Surveys in Combinatorics, London Math. Society Lecture Note Series 141, 1989, pp 148-188.
[22]
22. Motwani R, Raghavan P: Randomized Algorithms, Cambridge University Press 1995.
[23]
23. Rabin MO: The Choice Coordination Problem. Acta Informatica 17:121-134 (1982).
[24]
24. Saks M, Shavit N, Woll H: Optimal Time Randomized Consensus-Making Resilient Algorithms Fast in Practice. In Proc SIAM-ACM Symp Data-Struct and Algor 1991, pp 351-362.
[25]
25. Singh AK, Anderson JH, Gouda MG: The Elusive Atomic Register Revisited, J Assoc Comput Mach 41:311-339 (1994).
[26]
26. Tanenbaum A: Computer Networks. Prentice-Hall, Englewood Cliffs, NJ, 1981.
[27]
27. Tromp J: How to Construct an Atomic: Variable. In Proc 3rd Int'l Workshop Distribut Algor, Lect Notes Comput Sci, Vol. 392, Springer, Berlin Heidelberg New York, 1989, pp 492-302.
[28]
28. Tromp J, Vitányi P: Randomized Wait-Free Test-and-Set, CWI Tech. Report CS-R9113, Amsterdam, March 1991, submitted.

Cited By

View all
  • (2019)Naming Anonymous Processes with Test-and-Set RegistersProceedings of the 2019 3rd International Symposium on Computer Science and Intelligent Control10.1145/3386164.3386182(1-7)Online publication date: 25-Sep-2019
  • (2015)Test-and-Set in Optimal SpaceProceedings of the forty-seventh annual ACM symposium on Theory of Computing10.1145/2746539.2746627(615-623)Online publication date: 14-Jun-2015
  • (2014)Tight Bounds for Asynchronous RenamingJournal of the ACM10.1145/259763061:3(1-51)Online publication date: 2-Jun-2014
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image Distributed Computing
Distributed Computing  Volume 11, Issue 3
August 1998
55 pages

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 August 1998

Author Tags

  1. adaptive adversary
  2. asynchronous distributed protocols
  3. atomicity
  4. fault-tolerance
  5. naming problem
  6. randomized algorithms
  7. shared memory
  8. symmetry breaking
  9. test-and-set objects
  10. unique process ID
  11. wait-free read/write registers

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 03 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2019)Naming Anonymous Processes with Test-and-Set RegistersProceedings of the 2019 3rd International Symposium on Computer Science and Intelligent Control10.1145/3386164.3386182(1-7)Online publication date: 25-Sep-2019
  • (2015)Test-and-Set in Optimal SpaceProceedings of the forty-seventh annual ACM symposium on Theory of Computing10.1145/2746539.2746627(615-623)Online publication date: 14-Jun-2015
  • (2014)Tight Bounds for Asynchronous RenamingJournal of the ACM10.1145/259763061:3(1-51)Online publication date: 2-Jun-2014
  • (2013)Randomized loose renaming in o(log log n) timeProceedings of the 2013 ACM symposium on Principles of distributed computing10.1145/2484239.2484240(200-209)Online publication date: 22-Jul-2013
  • (2013)An $O\sqrt n$ Space Bound for Obstruction-Free Leader ElectionProceedings of the 27th International Symposium on Distributed Computing - Volume 820510.1007/978-3-642-41527-2_4(46-60)Online publication date: 14-Oct-2013
  • (2011)The Price of AnonymityACM Transactions on Autonomous and Adaptive Systems10.1145/2019591.20195926:4(1-28)Online publication date: 1-Oct-2011
  • (2011)Optimal-time adaptive strong renaming, with applications to countingProceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing10.1145/1993806.1993850(239-248)Online publication date: 6-Jun-2011
  • (2010)Fast randomized test-and-set and renamingProceedings of the 24th international conference on Distributed computing10.5555/1888781.1888794(94-108)Online publication date: 13-Sep-2010
  • (2009)The price of anonymityProceedings of the 23rd international conference on Distributed computing10.5555/1813164.1813208(341-355)Online publication date: 23-Sep-2009
  • (2008)Interacting urns processesProceedings of the 2008 ACM symposium on Applied computing10.1145/1363686.1364182(2046-2051)Online publication date: 16-Mar-2008
  • Show More Cited By

View Options

View options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media