Article

Dynamic-sized lock-free data structures

Authors:

Maurice Herlihy,

Victor Luchangco,

Paul Martin,

Mark MoirAuthors Info & Claims

PODC '02: Proceedings of the twenty-first annual symposium on Principles of distributed computing

Page 131

https://doi.org/10.1145/571825.571847

Published: 21 July 2002 Publication History

Get Access

Abstract

No abstract available.

References

[1]

D. Detlefs, P. Martin, M. Moir, and G. Steele. Lock-free reference counting. In Proceedings of the 20th Annual ACM Symposium on Principles of Distributed Computing, pages 190-199, 2001.

Digital Library

Google Scholar

[2]

M. Herlihy, V. Luchangco, P. Martin, and M. Moir. Dynamic-sized lock-free data structures. Technical Report TR-2002-110, Sun Microsystems Laboratories, 2002.

Digital Library

Google Scholar

[3]

M. Herlihy, V. Luchangco, and M. Moir. The repeat offender problem: A mechanism for supporting lock-free dynamic-sized data structures. Technical Report TR-2002-112, Sun Microsystems Laboratories, 2002.

Crossref

Google Scholar

[4]

M. Michael. Safe memory reclamation for dynamic lock-free objects using atomic reads and writes. In Proceedings of the 21st Annual ACM Symposium on the Principles of Distributed Computing, 2002.

Digital Library

Google Scholar

Cited By

View all

Moreno PAreias MRocha R(2021)On the Implementation of Memory Reclamation Methods in a Lock-Free Hash Trie DesignJournal of Parallel and Distributed Computing10.1016/j.jpdc.2021.04.007Online publication date: May-2021
https://doi.org/10.1016/j.jpdc.2021.04.007
Negele FFriedrich FOh SEgger B(2017)On the Design and Implementation of an Efficient Lock-Free SchedulerJob Scheduling Strategies for Parallel Processing10.1007/978-3-319-61756-5_2(22-45)Online publication date: 12-Jul-2017
https://doi.org/10.1007/978-3-319-61756-5_2
Herman NInala JHuang YTsai LKohler ELiskov BShrira LCadar CPietzuch PKeeton KRodrigues R(2016)Type-aware transactions for faster concurrent codeProceedings of the Eleventh European Conference on Computer Systems10.1145/2901318.2901348(1-16)Online publication date: 18-Apr-2016
https://dl.acm.org/doi/10.1145/2901318.2901348
Show More Cited By

Recommendations

Lock-Free Transactional Transformation for Linked Data Structures
Special Issue on SPAA 2016

Nonblocking data structures allow scalable and thread-safe access to shared data. They provide individual operations that appear to execute atomically. However, it is often desirable to execute multiple operations atomically in a transactional manner. ...
A practical wait-free simulation for lock-free data structures
PPoPP '14: Proceedings of the 19th ACM SIGPLAN symposium on Principles and practice of parallel programming

Lock-free data structures guarantee overall system progress, whereas wait-free data structures guarantee the progress of each and every thread, providing the desirable non-starvation guarantee for concurrent data structures. While practical lock-free ...
Transactional lock-free execution of lock-based programs
Special Issue: Proceedings of the 10th annual conference on Architectural Support for Programming Languages and Operating Systems

This paper is motivated by the difficulty in writing correct high-performance programs. Writing shared-memory multi-threaded programs imposes a complex trade-off between programming ease and performance, largely due to subtleties in coordinating access ...

Comments

Information & Contributors

Information

Published In

PODC '02: Proceedings of the twenty-first annual symposium on Principles of distributed computing

July 2002

307 pages

ISBN:1581134851

DOI:10.1145/571825

Conference Chair:
Aleta Ricciardi
Valaran Corp.

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: 21 July 2002

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

PODC02

Sponsor:

PODC02: Principles of Distributed Computing

July 21 - 24, 2002

California, Monterey

Acceptance Rates

PODC '02 Paper Acceptance Rate 43 of 149 submissions, 29%;

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

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

17
Total Citations
View Citations
400
Total Downloads

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

Reflects downloads up to 14 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Moreno PAreias MRocha R(2021)On the Implementation of Memory Reclamation Methods in a Lock-Free Hash Trie DesignJournal of Parallel and Distributed Computing10.1016/j.jpdc.2021.04.007Online publication date: May-2021
https://doi.org/10.1016/j.jpdc.2021.04.007
Negele FFriedrich FOh SEgger B(2017)On the Design and Implementation of an Efficient Lock-Free SchedulerJob Scheduling Strategies for Parallel Processing10.1007/978-3-319-61756-5_2(22-45)Online publication date: 12-Jul-2017
https://doi.org/10.1007/978-3-319-61756-5_2
Herman NInala JHuang YTsai LKohler ELiskov BShrira LCadar CPietzuch PKeeton KRodrigues R(2016)Type-aware transactions for faster concurrent codeProceedings of the Eleventh European Conference on Computer Systems10.1145/2901318.2901348(1-16)Online publication date: 18-Apr-2016
https://dl.acm.org/doi/10.1145/2901318.2901348
David TGuerraoui RTrigonakis V(2015)Asynchronized ConcurrencyACM SIGARCH Computer Architecture News10.1145/2786763.269435943:1(631-644)Online publication date: 14-Mar-2015
https://dl.acm.org/doi/10.1145/2786763.2694359
David TGuerraoui RTrigonakis V(2015)Asynchronized ConcurrencyACM SIGPLAN Notices10.1145/2775054.269435950:4(631-644)Online publication date: 14-Mar-2015
https://dl.acm.org/doi/10.1145/2775054.2694359
David TGuerraoui RTrigonakis VOzturk OEbcioglu KDwarkadas S(2015)Asynchronized ConcurrencyProceedings of the Twentieth International Conference on Architectural Support for Programming Languages and Operating Systems10.1145/2694344.2694359(631-644)Online publication date: 14-Mar-2015
https://dl.acm.org/doi/10.1145/2694344.2694359
Lee H(2010)Fast local-spin abortable mutual exclusion with bounded spaceProceedings of the 14th international conference on Principles of distributed systems10.5555/1940234.1940271(364-379)Online publication date: 14-Dec-2010
https://dl.acm.org/doi/10.5555/1940234.1940271
Gidenstam APapatriantafilou MSundell HTsigas P(2009)Efficient and Reliable Lock-Free Memory Reclamation Based on Reference CountingIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2008.16720:8(1173-1187)Online publication date: 1-Aug-2009
https://dl.acm.org/doi/10.1109/TPDS.2008.167
Klues KHandziski VLu CWolisz ACuller DGay DLevis P(2007)Integrating concurrency control and energy management in device driversACM SIGOPS Operating Systems Review10.1145/1323293.129428641:6(251-264)Online publication date: 14-Oct-2007
https://dl.acm.org/doi/10.1145/1323293.1294286
Klues KHandziski VLu CWolisz ACuller DGay DLevis PBressoud TKaashoek M(2007)Integrating concurrency control and energy management in device driversProceedings of twenty-first ACM SIGOPS symposium on Operating systems principles10.1145/1294261.1294286(251-264)Online publication date: 14-Oct-2007
https://dl.acm.org/doi/10.1145/1294261.1294286
Show More Cited By

View Options

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

Recommendations

Lock-Free Transactional Transformation for Linked Data Structures

A practical wait-free simulation for lock-free data structures

Transactional lock-free execution of lock-based programs

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

Login options

Full Access

PDF

eReader

Abstract

References

Cited By

Recommendations

Lock-Free Transactional Transformation for Linked Data Structures

A practical wait-free simulation for lock-free data structures

Transactional lock-free execution of lock-based programs

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

Get Access

Login options

Full Access

View options

PDF

eReader

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations