Skip to main content
SpringerLink
Log in

Polynomial and Adaptive Long-lived (2k- 1)-Renaming

(Extended Abstract)

  • Conference paper
  • First Online:
Book cover Distributed Computing (DISC 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1914))

Included in the following conference series:

Abstract

In the long-lived M-renaming problem, processes repeatedly obtain and release new names taken from a domain of size M. This paper presents the first polynomial algorithm for long-lived (2ft - 1)- renaming. The algorithm is adaptive as its step complexity is O(k4); here k is the point contention-the maximal number of simultaneously active processes in some point of the execution. Polynomial step complexity is achieved by having processes help each other to obtain new names, while adaptiveness is achieved by a novel application of sieves.

Supported by the fund for the promotion of sponsored research at the Technion.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Y. Afek, H. Attiya, A. Fouren, G. Stupp, and D. Touitou. Adaptive long-lived renaming using bounded memory. Available at http://www.cs.technion.ac.il/~hagit/pubs/AAFST99disc.ps.gz, Apr. 1999.

  2. Y. Afek, H. Attiya, A. Fouren, G. Stupp, and D. Touitou. Long-lived renaming made adaptive. In Proc. 18th ACM Symp. Principles of Dist. Comp., pages 91–103, 1999.

    Google Scholar 

  3. Y. Afek and M. Merritt. Fast, wait-free (2k-l)-renaming. In Proc. 18th ACM Symp. Principles of Dist. Comp., pages 105–112, 1999.

    Google Scholar 

  4. Y. Afek, G. Stupp, and D. Touitou. Long-lived and adaptive collect with applications. In Proc. 40th IEEE Symp. Foundations of Comp. Sci., pages 262–272, 1999.

    Google Scholar 

  5. Y. Afek, G. Stupp, and D. Touitou. Long-lived and adaptive atomic snapshot and immediate snapshot.In Proc. 19th ACM Symp. Principles of Dist. Comp., 2000. To appear.

    Google Scholar 

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

    Google Scholar 

  7. H. Attiya and A. Fouren. Adaptive wait-free algorithms for lattice agreement and renaming. In Proc. 17th ACM Symp. Principles of Dist. Comp., pages 277–286, 1998.

    Google Scholar 

  8. H. Attiya and A. Fouren.An adaptive collect algorithm with applications. Submitted for publication. Available at http://www.cs.technion.ac.il/~hagit/pubs/AF99ful.ps.gz, Aug. 1999.

  9. H. Attiya and A. Fouren. Adaptive long-lived renaming with read and write operations. Technical Report 956, Faculty of Computer Science, The Technion, Mar. 1999. Available at http://www.cs.technion.ac.il/~hagit/pubs/tr0956.ps.gz.

  10. A. Bar-Noy and D. Dolev. A partial equivalence between shared-memory and message-passing in an asynchronous fail-stop distributed environment. Math. Sys. Theory, 26(l):21–39, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  11. E. Borowsky and E. Gafni. Generalized FLP impossibility result for-resilient asynchronous computations. In Proc. 25th ACM Symp. Theory of Comp., pages 91–100, 1993.

    Google Scholar 

  12. E. Borowsky and E. Gafni. Immediate atomic snapshots and fast renaming. In Proc. 12th ACM Symp. Principles of Dist. Comp., pages 41–52, 1993.

    Google Scholar 

  13. E. Borowsky, E. Gafni, N. Lynch, and S. Rajsbaum. The BG distributed simulation algorithm. Technical Report MIT/LCS/TM-573, Laboratory for Computer Science, MIT, Dec. 1997.

    Google Scholar 

  14. H. Buhrman, J. A. Garay, J.-H. Hoepman, and M. Moir. Long-lived renaming made fast. In Proc. l th ACM Symp. Principles of Dist. Comp., pages 194–203, 1995.

    Google Scholar 

  15. J. E. Burns and G. L. Peterson. The ambiguity of choosing. In Proc. 8th ACM Symp. Principles of Dist. Comp., pages 145–158, 1989.

    Google Scholar 

  16. A. Fouren. Exponential examples for two renaming algorithms. Available at http://www.cs.technion.ac.il/~hagit/pubs/expo.ps.gz, Aug. 1999.

  17. E. Gafni. More about renaming: Fast algorithm and reduction to the k-set test-and-set problem. Unpublished manuscript, 1992.

    Google Scholar 

  18. M. Herlihy and N. Shavit. A simple constructive computability theorem for wait-free computation. In Proc. 26th ACM Symp. Theory of Comp., pages 243–252, 1994.

    Google Scholar 

  19. L. Lamport. A fast mutual exclusion algorithm. ACM Trans. Comput. Syst., 5(1):1–11, Feb. 1987.

    Google Scholar 

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

    Google Scholar 

  21. M. Moir and J. H. Anderson. Wait-free algorithms for fast, long-lived renaming. Sci. Comput. Programming, 25(1):1–39, Oct. 1995.

    Google Scholar 

  22. M. Moir and J. A. Garay. Fast long-lived renaming improved and simplified. In Proc. 10th Int. Workshop on Dist. Algorithms, volume 1151 of Lecture Notes in Computer Science, pages 287–303. Springer-Verlag, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The Technion, Haifa, 32000, Israel

    Hagit Attiya & Arie Fouren

Authors
  1. Hagit Attiya
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Arie Fouren
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Brown University, 115 Waterman Street, Providence, RI 02912, USA

    Maurice Herlihy

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Attiya, H., Fouren, A. (2000). Polynomial and Adaptive Long-lived (2k- 1)-Renaming. In: Herlihy, M. (eds) Distributed Computing. DISC 2000. Lecture Notes in Computer Science, vol 1914. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40026-5_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-40026-5_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41143-7

  • Online ISBN: 978-3-540-40026-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation