Skip to main content
SpringerLink
Log in

Fully-Adaptive Algorithms for Long-Lived Renaming

  • Conference paper
Distributed Computing (DISC 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4167))

Included in the following conference series:

Abstract

Long-lived renaming allows processes to repeatedly get distinct names from a small name space and release these names. This paper presents two long-lived renaming algorithms in which the name a process gets is bounded above by the number of processes currently occupying a name or performing one of these operations. The first is asynchronous, uses LL/SC objects, and has step complexity that is linear in the number of processes, c, currently getting or releasing a name. The second is synchronous, uses registers and counters, and has step complexity that is polylogarithmic in c. Both tolerate any number of process crashes.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Afek, Y., Attiya, H., Fouren, A., Stupp, G., Touitou, D.: Long-lived renaming made adaptive. In: Proceedings of the 18th Annual ACM Symposium on Principles of Distributed Computing, pp. 91–104 (May 1999)

    Google Scholar 

  2. Afek, Y., Dauber, D., Touitou, D.: Wait-free made fast. In: Proceedings of the Twenty-Seventh Annual ACM Symposium on the Theory of Computing, pp. 538–547 (May 1995)

    Google Scholar 

  3. Afek, Y., Merritt, M.: Fast, wait-free (2k − 1)-renaming. In: Proceedings of the 18th Annual ACM Symposium on Principles of Distributed Computing, pp. 105–112 (1999)

    Google Scholar 

  4. Afek, Y., Stupp, G., Touitou, D.: Long lived adaptive splitter and applications. Distributed Computing 15, 67–86 (2002)

    Article  Google Scholar 

  5. Attiya, H., Bar-Noy, A., Dolev, D., Peleg, D., Reischuk, R.: Renaming in an asynchronous environment. Journal of the ACM 37(3), 524–548 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  6. Attiya, H., Djerassi-Shintel, T.: Time bounds for decision problems in the presence of timing uncertainty and failures. In: Schiper, A. (ed.) WDAG 1993. LNCS, vol. 725, pp. 204–214. Springer, Heidelberg (1993)

    Google Scholar 

  7. Attiya, H., Fouren, A.: Polynomial and adaptive long-lived (2k − 1)-renaming. In: Herlihy, M.P. (ed.) DISC 2000. LNCS, vol. 1914, pp. 149–159. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  8. Attiya, H., Fouren, A.: Adaptive and efficient algorithms for lattice agreement and renaming. SIAM Journal on Computing 31(2), 642–664 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  9. Attiya, H., Fouren, A.: Algorithms adaptive to point contention. Journal of the ACM 50(4), 444–468 (2003)

    Article  MathSciNet  Google Scholar 

  10. Attiya, H., Welch, J.: Distributed Computing Fundamentals, Simulations, and Advanced Topics, 2nd edn. Wiley, Chichester (2004)

    Google Scholar 

  11. Bar-Noy, A., Dolev, D.: Shared-memory vs. message-passing in an asynchronous distributed environment. In: Proceedings of the 8th Annual ACM Symposium on Principles of distributed computing, pp. 307–318 (August 1989)

    Google Scholar 

  12. Burns, J., Peterson, G.: The ambiguity of choosing. In: Proceedings of the 8th Annual Symposium on Principles of Distributed Computing, pp. 145–158 (August 1989)

    Google Scholar 

  13. Chaudhuri, S., Herlihy, M., Tuttle, M.: Wait-free implementations in message-passing systems. Theoretical Computer Science 220(1), 211–245 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  14. Georgiou, C., Russell, A., Shvartsman, A.A.: The complexity of synchronous iterative do-all with crashes. Distributed Computing 17, 47–63 (2004)

    Article  Google Scholar 

  15. Hagerup, T., Raman, R.: An efficient quasidictionary. In: Penttonen, M., Schmidt, E.M. (eds.) SWAT 2002. LNCS, vol. 2368, pp. 1–18. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  16. Herlihy, M., Luchangco, V., Moir, M.: Space- and time-adaptive nonblocking algorithms. Electr. Notes Theor. Comput. Sci. 78 (2003)

    Google Scholar 

  17. Herlihy, M., Rajsbaum, S.: Algebraic spans. Math. Struct. in Comp. Science 10, 549–573 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  18. Herlihy, M., Shavit, N.: The topological structure of asynchronous computability. Journal of the ACM 46(6), 858–923 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  19. Herlihy, M., Tuttle, M.: Lower bounds for wait-free computation in message-passing systems. In: Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing, pp. 347–362 (August 1990)

    Google Scholar 

  20. Inoue, M., Umetani, S., Masuzawa, T., Fujiwara, H.: Adaptive long-lived O(k 2)-renaming with O(k 2) steps. In: Welch, J.L. (ed.) DISC 2001. LNCS, vol. 2180, pp. 123–133. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  21. Moir, M.: Fast, long-lived renaming improved and simplified. Science of Computer Programming 30(3), 287–308 (1998)

    Article  MathSciNet  Google Scholar 

  22. Moir, M., Anderson, J.: Wait-free algorithms for fast, long-lived renaming. Science of Computer Programming 25(1), 1–39 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  23. Shvartsman, A.A.: Achieving optimal CRCW PRAM fault-tolerance. Information Processing Letters 39(2), 59–66 (1991)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Applied Computer Science, University of Winnipeg, Winnipeg, Canada

    Alex Brodsky

  2. Dept. of Computer Science, University of Toronto, Toronto, Canada

    Faith Ellen & Philipp Woelfel

Authors
  1. Alex Brodsky
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Faith Ellen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Philipp Woelfel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Ben Gurion University of the Negev, Israel

    Shlomi Dolev

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Brodsky, A., Ellen, F., Woelfel, P. (2006). Fully-Adaptive Algorithms for Long-Lived Renaming. In: Dolev, S. (eds) Distributed Computing. DISC 2006. Lecture Notes in Computer Science, vol 4167. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11864219_29

Download citation

  • DOI: https://doi.org/10.1007/11864219_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44624-8

  • Online ISBN: 978-3-540-44627-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation