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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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.
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.
Y. Afek and M. Merritt. Fast, wait-free (2k-l)-renaming. In Proc. 18th ACM Symp. Principles of Dist. Comp., pages 105–112, 1999.
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.
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.
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.
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.
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.
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.
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.
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.
E. Borowsky and E. Gafni. Immediate atomic snapshots and fast renaming. In Proc. 12th ACM Symp. Principles of Dist. Comp., pages 41–52, 1993.
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.
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.
J. E. Burns and G. L. Peterson. The ambiguity of choosing. In Proc. 8th ACM Symp. Principles of Dist. Comp., pages 145–158, 1989.
A. Fouren. Exponential examples for two renaming algorithms. Available at http://www.cs.technion.ac.il/~hagit/pubs/expo.ps.gz, Aug. 1999.
E. Gafni. More about renaming: Fast algorithm and reduction to the k-set test-and-set problem. Unpublished manuscript, 1992.
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.
L. Lamport. A fast mutual exclusion algorithm. ACM Trans. Comput. Syst., 5(1):1–11, Feb. 1987.
M. Moir. Fast, long-lived renaming improved and simplified. Sci. Comput. Programming, 30(3):287–308, May 1998.
M. Moir and J. H. Anderson. Wait-free algorithms for fast, long-lived renaming. Sci. Comput. Programming, 25(1):1–39, Oct. 1995.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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