Article

Fully-adaptive algorithms for long-lived renaming

Authors:

Philipp WoelfelAuthors Info & Claims

DISC'06: Proceedings of the 20th international conference on Distributed Computing

Pages 413 - 427

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

Published: 18 September 2006 Publication History

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.

References

[1]

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

Digital Library

[2]

Y. Afek, D. Dauber, and D. Touitou. Wait-free made fast. In Proceedings of the Twenty-Seventh Annual ACM Symposium on the Theory of Computing, pages 538-547, May 1995.

Digital Library

[3]

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

Digital Library

[4]

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

Digital Library

[5]

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

Digital Library

[6]

H. Attiya and T. Djerassi-Shintel. Time bounds for decision problems in the presence of timing uncertainty and failures. Lecture Notes in Computer Science, 725:204-214, 1993.

Digital Library

[7]

H. Attiya and A. Fouren. Polynomial and adaptive long-lived (2k - 1)-renaming. Lecture Notes in Computer Science, 1914:149-159, 2000.

Digital Library

[8]

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

Digital Library

[9]

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

Digital Library

[10]

H. Attiya and J. Welch. Distributed Computing Fundamentals, Simulations, and Advanced Topics (2nd Ed.). Wiley, 2004.

Digital Library

[11]

A. Bar-Noy and D. Dolev. Shared-memory vs. message-passing in an asynchronous distributed environment. In Proceedings of the 8th Annual ACM Symposium on Principles of distributed computing, pages 307-318, Aug. 1989.

Digital Library

[12]

J. Burns and G. Peterson. The ambiguity of choosing. In Proceedings of the 8th Annual Symposium on Principles of Distributed Computing, pages 145-158, Aug. 1989.

Digital Library

[13]

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

Digital Library

[14]

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

Digital Library

[15]

T. Hagerup and R. Raman. An efficient quasidictionary. In Proceedings of SWAT, volume 2368 of Lecture Notes in Computer Science, pages 1-18, 2002.

Digital Library

[16]

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

[17]

M. Herlihy and S. Rajsbaum. Algebraic spans. Math. Struct. in Comp. Science, 10:549-573, 2000.

Digital Library

[18]

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

Digital Library

[19]

M. Herlihy and M. Tuttle. Lower bounds for wait-free computation in message-passing systems. In Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing, pages 347-362, Aug. 1990.

Digital Library

[20]

M. Inoue, S. Umetani, T. Masuzawa, and H. Fujiwara. Adaptive long-lived O(k ²)- pa-ming with O(k ²) steps. Lecture Notes in Computer Science, 2180:123-133, 2001.

Digital Library

[21]

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

Digital Library

[22]

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

Digital Library

[23]

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

Digital Library

Cited By

Lozi JDavid FThomas GLawall JMuller G(2016)Fast and Portable Locking for Multicore ArchitecturesACM Transactions on Computer Systems10.1145/284507933:4(1-62)Online publication date: 4-Jan-2016
https://dl.acm.org/doi/10.1145/2845079
Alistarh DAspnes JCensor-Hillel KGilbert SGuerraoui R(2014)Tight Bounds for Asynchronous RenamingJournal of the ACM10.1145/259763061:3(1-51)Online publication date: 2-Jun-2014
https://dl.acm.org/doi/10.1145/2597630
Alistarh DAspnes JCensor-Hillel KGilbert SZadimoghaddam MGavoille CFraigniaud P(2011)Optimal-time adaptive strong renaming, with applications to countingProceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing10.1145/1993806.1993850(239-248)Online publication date: 6-Jun-2011
https://dl.acm.org/doi/10.1145/1993806.1993850
Show More Cited By

Fully-adaptive algorithms for long-lived renaming
1. Theory of computation

Recommendations

Fully-adaptive algorithms for long-lived renaming

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 ...
Polynominal and Adaptive Long-Lived (2k-1)-Renaming
DISC '00: Proceedings of the 14th International Conference on Distributed Computing

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 (2 k - 1)- renaming. The algorithm is adaptive as its step ...
Long lived adaptive splitter and applications

Long-lived and adaptive implementations of mutual exclusion and renaming in the read/write shared memory model are presented. An implementation of a task is adaptive if the step complexity of any operation in the implementation is a function of the ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

DISC'06: Proceedings of the 20th international conference on Distributed Computing

September 2006

585 pages

ISBN:3540446249

Editor:
Shlomi Dolev
Department of Computer Science, Ben Gurion University of the Negev, Israel

Sponsors

BGU: BGU
Swedish Institute of Computer Science: Swedish Institute of Computer Science
Sun Microsystems
Intel: Intel
Microsoft Research: Microsoft Research

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 18 September 2006

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 18 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Lozi JDavid FThomas GLawall JMuller G(2016)Fast and Portable Locking for Multicore ArchitecturesACM Transactions on Computer Systems10.1145/284507933:4(1-62)Online publication date: 4-Jan-2016
https://dl.acm.org/doi/10.1145/2845079
Alistarh DAspnes JCensor-Hillel KGilbert SGuerraoui R(2014)Tight Bounds for Asynchronous RenamingJournal of the ACM10.1145/259763061:3(1-51)Online publication date: 2-Jun-2014
https://dl.acm.org/doi/10.1145/2597630
Alistarh DAspnes JCensor-Hillel KGilbert SZadimoghaddam MGavoille CFraigniaud P(2011)Optimal-time adaptive strong renaming, with applications to countingProceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing10.1145/1993806.1993850(239-248)Online publication date: 6-Jun-2011
https://dl.acm.org/doi/10.1145/1993806.1993850
Alistarh DAttiya HGilbert SGiurgiu AGuerraoui R(2010)Fast randomized test-and-set and renamingProceedings of the 24th international conference on Distributed computing10.5555/1888781.1888794(94-108)Online publication date: 13-Sep-2010
https://dl.acm.org/doi/10.5555/1888781.1888794
Okun M(2010)Strong order-preserving renaming in the synchronous message passing modelTheoretical Computer Science10.1016/j.tcs.2010.06.001411:40-42(3787-3794)Online publication date: 1-Sep-2010
https://dl.acm.org/doi/10.1016/j.tcs.2010.06.001

View Options

View options

Figures

Tables

Media

View Table of Conten