Article

Free access

Fast, long-lived renaming improved and simplified

Authors:

Mark Moir,

Juan A. GarayAuthors Info & Claims

PODC '96: Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing

Page 152

https://doi.org/10.1145/248052.248078

Published: 01 May 1996 Publication History

PDF eReader

Abstract

No abstract available.

References

[1]

H. Buhrman, J. Garay, J. Hoepman, and M. Moir, "Long-Lived Renaming Made Fast", Proceedings of the ldth Annual A CM Symposium on Principles of Distributed Computing, 1995, pp. 194-203.

Digital Library

Google Scholar

[2]

J. Burns and G. Peterson, "The Ambiguity of Choosing", Proceedings of the Eighth Annual A CM Symposium on Principles of Distributed Computing, 1989, pp. 145-157.

Digital Library

Google Scholar

[3]

M. Moir and j. Anderson, "Wait-Free Algorithms for Fast, Long-Lived Renaming", Science of Computer Programming 25 (1995), pp. 1-39

Digital Library

Google Scholar

[4]

M. Moir and J. Garay, "Fast, Long-Lived Renaming Improved and Simplified", Technical Report, University of North Carolina, available at http: j/~. cs. uric. edu/~moir.

Google Scholar

Cited By

View all

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
Dalessandro LSpear MScott M(2010)NOrecACM SIGPLAN Notices10.1145/1837853.169346445:5(67-78)Online publication date: 9-Jan-2010
https://dl.acm.org/doi/10.1145/1837853.1693464
Dalessandro LSpear MScott MGovindarajan RPadua DHall M(2010)NOrecProceedings of the 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming10.1145/1693453.1693464(67-78)Online publication date: 9-Jan-2010
https://dl.acm.org/doi/10.1145/1693453.1693464
Show More Cited By

Index Terms

Fast, long-lived renaming improved and simplified

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 ...
Long-lived Transactions Made Less Harmful
SIGMOD '20: Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data

Many systems use snapshot isolation, or something similar, as defaults, and multi-version concurrency control (MVCC) remains essential to offering such point-in-time consistency. One major issue in MVCC is the timely removal of unnecessary versions of ...
Long-Lived Adaptive Collect with Applications
FOCS '99: Proceedings of the 40th Annual Symposium on Foundations of Computer Science

A distributed algorithm is adaptive if the worst case step complexity of its operations is bounded by a function of the number of processes that are concurrently active during the operation (rather than a function of N, the total number of processes, ...

Comments

Information & Contributors

Information

Published In

PODC '96: Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing

May 1996

344 pages

ISBN:0897918002

DOI:10.1145/248052

Chairmen:
James E. Burns
Bellcore
,
Yoram Moses
Weizmann Institute of Science

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 1996

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

PODC96

Sponsor:

PODC96: 15th Annual ACM Symposium on Principles of Distributed Computing

May 23 - 26, 1996

Pennsylvania, Philadelphia, USA

Acceptance Rates

PODC '96 Paper Acceptance Rate 69 of 117 submissions, 59%;

Overall Acceptance Rate 740 of 2,477 submissions, 30%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
153
Total Downloads

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

Reflects downloads up to 10 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

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
Dalessandro LSpear MScott M(2010)NOrecACM SIGPLAN Notices10.1145/1837853.169346445:5(67-78)Online publication date: 9-Jan-2010
https://dl.acm.org/doi/10.1145/1837853.1693464
Dalessandro LSpear MScott MGovindarajan RPadua DHall M(2010)NOrecProceedings of the 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming10.1145/1693453.1693464(67-78)Online publication date: 9-Jan-2010
https://dl.acm.org/doi/10.1145/1693453.1693464
Eberly WHigham LWarpechowska-Gruca J(2006)Long-lived, fast, waitfree renaming with optimal name space and high throughputDistributed Computing10.1007/BFb0056480(149-160)Online publication date: 2-Jun-2006
https://doi.org/10.1007/BFb0056480
Afek YAttiya HFouren AStupp GTouitou DCoan BWelch J(1999)Long-lived renaming made adaptiveProceedings of the eighteenth annual ACM symposium on Principles of distributed computing10.1145/301308.301335(91-103)Online publication date: 1-May-1999
https://dl.acm.org/doi/10.1145/301308.301335
Attiya HFouren ACoan BAfek Y(1998)Adaptive wait-free algorithms for lattice agreement and renaming (extended abstract)Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing10.1145/277697.277749(277-286)Online publication date: 1-Jun-1998
https://dl.acm.org/doi/10.1145/277697.277749

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Fully-adaptive algorithms for long-lived renaming

Long-lived Transactions Made Less Harmful

Long-Lived Adaptive Collect with Applications

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

Abstract

References

Cited By

Index Terms

Recommendations

Fully-adaptive algorithms for long-lived renaming

Long-lived Transactions Made Less Harmful

Long-Lived Adaptive Collect with Applications

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations