Abstract
We present a long-lived renaming algorithm in the read/write shared memory model. Our algorithm is adaptive to the point contention k andworks with bounded memory and bounded values.We consider the renaming problem where each process obtains the new name in the range 1, ..., k(2k−1). In this paper, we present an algorithm with O(k 2) step complexity and O(n 2 N) space complexity, where n and N are an upper bound of k and the number of processes, respectively. The previous best result under the same problem setting is the algorithm with O(k 3) step complexity and O(n 3 N) space complexity presented byAfek et. al[1]. They also presented the algorithm with O(k 2logk) step complexity and O(n 3 N) space complexity under the condition where unbounded values are allowed. That is, we improve the above two algorithms.
This work is supported in part by Japan Society for the Promotion of Science (JSPS), Grantin- Aid for Scientific Research C(2) (No.12680349) and A (No.12780225).
This is a preview of subscription content, log in via an institution to check access.
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, D. Touitou: Adaptive long-lived renaming using bounded memory. (1999) Available at http://www.cs.technion.ac.il/~hagit/pubs/AAFST99disc.ps.gz.
Y. Afek, G. Stupp, D. Touitou: Long-lived and adaptive collect with applications. In Proc. 40th IEEE Symp. Foundations of Comp. Sci. (1999) 262–272
Y. Afek, G. Stupp, D. Touitou: Long-lived adaptive atomic snapshot and immediate snapshot. In Proc. 19th ACM Symp. Principles of Dist. Comp. (2000) 71–80
A. Bar-Noy, D. Dolev: Shared memory versus message-passing in an asynchronous distributed environment. Proc. of the 8th Annual ACM Symposium on Principles of Distributed Computing (1989) 307–318
E. Borowsky, E. Gafni: Immediate atomic snapshots and fast renaming. In Proc. 12th ACM Symp. Principles of Dist. Comp. (1993) 41–52
M. Moir, J.H. Anderson: Fast, long-lived renaming. In Proc. 8th Int. Workshop on Dist. Algorithms (1994) 141–155
H. Buhrman, J.A. Garay, J.H. Hoepman, M. Moir: Long-lived renaming made fast. In Proc. 14th ACM Symp. Principles of Dist. Comp. (1995) 194–203
M. Moir, J.A. Garay: Fast long-lived renaming improved and simplified. In Proc. 10th Int. Workshop on Dist. Algorithms (1996) 287–303
H. Attiya, A. Fouren: Adaptive wait-free algorithms for lattie agreement and renaming. In Proc. 17th ACM Symp. Principles of Dist. Comp. (1998) 277–286
Y. Afek, M. Merritt: Fast, wait-free (2k-1)-renaming. In Proc. 18th ACM Symp. Principles of Dist. Comp. (1999) 105–112
Y. Afek, H. Attiya, A. Fouren, G. Stupp, D. Touitou: Long-lived renaming made adaptive. In Proc. 18th ACM Symp. Principles of Dist. Comp. (1999) 91–103
H. Attiya, A. Fouren: Polynomial and adaptive long-lived (2k-1)-renaming. In Proc. 14th Int. Symp. on Dist. Comp. (2000)
H. Attiya, A. Fouren: An adaptive collect algorithm with applications. (1999) Available at http://www.cs.tehnion.ac.il/~hagit/pubs/AF99ful.ps.gz.
Herlihy, M.:Wait-free synchronization.ACMTrans. on Programming Languages and Systems 13 (1991) 124–149
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Inoue, M., Umetani, S., Fujiwara, H., Masuzawa, T. (2001). Adaptive Long-lived O(k 2)-Renaming with O(k 2) Steps. In: Welch, J. (eds) Distributed Computing. DISC 2001. Lecture Notes in Computer Science, vol 2180. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45414-4_9
Download citation
DOI: https://doi.org/10.1007/3-540-45414-4_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42605-9
Online ISBN: 978-3-540-45414-4
eBook Packages: Springer Book Archive