skip to main content
10.1145/2145816.2145869acmconferencesArticle/Chapter ViewAbstractPublication PagesppoppConference Proceedingsconference-collections
poster

Wait-free linked-lists

Published: 25 February 2012 Publication History

Abstract

The linked-list data structure is fundamental and ubiquitous. Lock-free versions of the linked-list are well known. However, the existence of a practical wait-free linked-list has been open. In this work we designed such a linked-list. To achieve better performance, we have also extended this design using the fast-path-slow-path methodology. The resulting implementation achieves performance which is competitive with that of Harris's lock-free list, while still guaranteeing non-starvation via wait-freedom. We have also developed a proof for the correctness and the wait-freedom of our design.

References

[1]
Panagiota Fatourou and Nikolaos D. Kallimanis. A highly-efficient wait-free universal construction. In SPAA, pages 325--334, 2011.
[2]
Mikhail Fomitchev and Eric Ruppert. Lock-free linked lists and skip lists. In Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, PODC '04, pages 50--59, New York, NY, USA, 2004. ACM.
[3]
Timothy L. Harris. A pragmatic implementation of non-blocking linked-lists. In Proceedings of the 15th International Conference on Distributed Computing, DISC '01, London, UK, UK, 2001. Springer-Verlag.
[4]
Maurice Herlihy. A methodology for implementing highly concurrent objects. ACM Trans. Program. Lang. Syst., 15(5):745--770, 1993.
[5]
Maurice Herlihy and Nir Shavit. The Art of Multiprocessor Programming. Morgan Kaufmann, 2008.
[6]
Alex Kogan and Erez Petrank. Wait-free queues with multiple enqueuers and dequeuers. In PPOPP, pages 223--234, 2011.
[7]
Alex Kogan and Erez Petrank. A methodology for creating fast wait-free data structures. In PPOPP, 2012.
[8]
Maged M. Michael. High performance dynamic lock-free hash tables and list-based sets. In Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures, SPAA '02, pages 73--82, New York, NY, USA, 2002. ACM.
[9]
John D. Valois. Lock-free linked lists using compare-and-swap. In Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing, PODC '95, pages 214--222, New York, NY, USA, 1995. ACM.

Cited By

View all
  • (2022)DHash: Dynamic Hash Tables With Non-Blocking Regular OperationsIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2022.315149933:12(3274-3290)Online publication date: 1-Dec-2022
  • (2021)OrcGCProceedings of the 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming10.1145/3437801.3441596(205-218)Online publication date: 17-Feb-2021
  • (2019)An Efficient Practical Concurrent Wait-Free Unbounded Graph2019 IEEE 21st International Conference on High Performance Computing and Communications; IEEE 17th International Conference on Smart City; IEEE 5th International Conference on Data Science and Systems (HPCC/SmartCity/DSS)10.1109/HPCC/SmartCity/DSS.2019.00348(2487-2494)Online publication date: Aug-2019
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
PPoPP '12: Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming
February 2012
352 pages
ISBN:9781450311601
DOI:10.1145/2145816
  • cover image ACM SIGPLAN Notices
    ACM SIGPLAN Notices  Volume 47, Issue 8
    PPOPP '12
    August 2012
    334 pages
    ISSN:0362-1340
    EISSN:1558-1160
    DOI:10.1145/2370036
    Issue’s Table of Contents

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 February 2012

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. linked-list
  2. lock-freedom
  3. wait-freedom

Qualifiers

  • Poster

Conference

PPoPP '12
Sponsor:

Acceptance Rates

Overall Acceptance Rate 230 of 1,014 submissions, 23%

Upcoming Conference

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)30
  • Downloads (Last 6 weeks)5
Reflects downloads up to 10 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2022)DHash: Dynamic Hash Tables With Non-Blocking Regular OperationsIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2022.315149933:12(3274-3290)Online publication date: 1-Dec-2022
  • (2021)OrcGCProceedings of the 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming10.1145/3437801.3441596(205-218)Online publication date: 17-Feb-2021
  • (2019)An Efficient Practical Concurrent Wait-Free Unbounded Graph2019 IEEE 21st International Conference on High Performance Computing and Communications; IEEE 17th International Conference on Smart City; IEEE 5th International Conference on Data Science and Systems (HPCC/SmartCity/DSS)10.1109/HPCC/SmartCity/DSS.2019.00348(2487-2494)Online publication date: Aug-2019
  • (2018)Every data structure deserves lock-free memory reclamationProceedings of the ACM on Programming Languages10.1145/32765132:OOPSLA(1-24)Online publication date: 24-Oct-2018
  • (2018)FA-Stack: A Fast Array-Based Stack with Wait-Free Progress GuaranteeIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2017.277012129:4(843-857)Online publication date: 1-Apr-2018
  • (2018)A Scalable Linearizable Multi-Index Table2018 IEEE 38th International Conference on Distributed Computing Systems (ICDCS)10.1109/ICDCS.2018.00029(200-211)Online publication date: Jul-2018
  • (2018)Self-adaptive concurrent componentsAutomated Software Engineering10.1007/s10515-017-0219-025:1(47-99)Online publication date: 1-Mar-2018
  • (2017)Practical Concurrent Self-Organizing Lists2017 IEEE 23rd International Conference on Parallel and Distributed Systems (ICPADS)10.1109/ICPADS.2017.00058(384-391)Online publication date: Dec-2017
  • (2017)Expander: Lock-Free Cache for a Concurrent Data Structure2017 IEEE 24th International Conference on High Performance Computing (HiPC)10.1109/HiPC.2017.00027(162-171)Online publication date: Dec-2017
  • (2016)Concurrent Search Data Structures Can Be Blocking and Practically Wait-FreeProceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/2935764.2935774(337-348)Online publication date: 11-Jul-2016
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media