Skip to main content
SpringerLink
Log in

Fully-adaptive algorithms for long-lived renaming

  • Published:
Distributed Computing Aims and scope Submit manuscript

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 algorithm 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 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. 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 (1999)

  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 (1995)

  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)

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

    Article  Google Scholar 

  5. Alistarh, D., Aspnes, J., Censor-Hillel, K., Gilbert, S., Zadimoghaddam, M.: Optimal-time adaptive strong renaming, with applications to counting. In: Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, pp. 239–248 (2011)

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

    Article  MathSciNet  MATH  Google Scholar 

  7. Attiya H., Djerassi-Shintel T.: Time bounds for decision problems in the presence of timing uncertainty and failures. Lect. Notes Comput. Sci. 725, 204–214 (1993)

    Google Scholar 

  8. Attiya H., Fouren A.: Polynomial and adaptive long-lived (2k−1)-renaming. Lect. Notes Comput. Sci. 1914, 149–159 (2000)

    Article  Google Scholar 

  9. Attiya H., Fouren A.: Adaptive and efficient algorithms for lattice agreement and renaming. SIAM J. Comput. 31(2), 642–664 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  10. Attiya H., Fouren A.: Algorithms adaptive to point contention. J. ACM 50(4), 444–468 (2003)

    Article  MathSciNet  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 (1989)

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

  13. Castañeda, A., Rajsbaum, S.: New combinatorial topology upper and lower bounds for renaming. In: Proceedings of the 27th Annual ACM Symposium on Principles of Distributed Computing, pp. 295–304 (2008)

  14. Chaudhuri S., Herlihy M., Tuttle M.: Wait-free implementations in message-passing systems. Theor. Comput. Sci. 220(1), 211–245 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  15. Chlebus, B.S., Kowalski, D.R.: Asynchronous exclusive selection. In: Proceedings of the 27th Annual ACM Symposium on Principles of Distributed Computing, pp. 375–384 (2008)

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

    Article  Google Scholar 

  17. Hagerup, T., Raman, R.: An efficient quasidictionary. In: Proceedings of SWAT, Lecture Notes in Computer Science, vol. 2368, pp. 1–18 (2002)

  18. 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 (1990)

  19. Inoue M., Umetani S., Masuzawa T., Fujiwara H.: Adaptive long-lived O(k 2)-renaming with O(k 2) steps. Lect. Notes Comput. Sci. 2180, 123–133 (2001)

    Article  Google Scholar 

  20. Lipton R.J., Park A.: The processor identity problem. Inf. Process. Lett. 36(2), 91–94 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  21. Moir M.: Fast, long-lived renaming improved and simplified. Sci. Comput. Programm. 30(3), 287–308 (1998)

    Article  MathSciNet  Google Scholar 

  22. Moir M., Anderson J.: Wait-free algorithms for fast, long-lived renaming. Sci. Comput. Programm. 25(1), 1–39 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  23. Shvartsman, A.A.: Fault-tolerant and efficient parallel computation. Ph.D. thesis, Brown University (1992)

Download references

Author information

Authors and Affiliations

  1. Faculty of Computer Science, Dalhousie University, 6050 University Ave., Halifax, NS, B3H 1W5, Canada

    Alex Brodsky

  2. Department of Computer Science, University of Toronto, 10 King’s College Road, Toronto, ON, M5S 3G4, Canada

    Faith Ellen

  3. Department of Computer Science, University of Calgary, 2500 University Dr. NW, Calgary, AB, T2N 1N4, Canada

    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

Corresponding author

Correspondence to Philipp Woelfel.

Additional information

This research was supported by NSERC, the Scalable Synchronization Group at Sun Microsystems, and the German Research Foundation (grant Wo1232/1-1). A preliminary version of this paper appeared in DISC 2006.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Brodsky, A., Ellen, F. & Woelfel, P. Fully-adaptive algorithms for long-lived renaming. Distrib. Comput. 24, 119–134 (2011). https://doi.org/10.1007/s00446-011-0137-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00446-011-0137-5

Keywords

Search

Navigation