Document Open Access Logo

Recoverable Lock-Free Locks

Authors Hagit Attiya , Panagiota Fatourou , Eleftherios Kosmas , Yuanhao Wei

PDF

File

Thumbnail PDF
PDF
LIPIcs.OPODIS.2025.17.pdf
  • Filesize: 0.8 MB
  • 19 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Concurrent algorithms
  • Software and its engineering → Synchronization
Keywords
  • recoverable computing
  • NVM
  • lock
  • lock-freedom

Metrics

Abstract

This paper presents the first transformation that introduces both lock-freedom and recoverability. Our transformation starts with a lock-based implementation, and provides a recoverable, lock-free substitution to lock acquire and lock release operations. The transformation supports nested locks for generality and ensures recoverability without jeopardising the correctness of the lock-based implementation it is applied on.

Cite As Get BibTex

Hagit Attiya, Panagiota Fatourou, Eleftherios Kosmas, and Yuanhao Wei. Recoverable Lock-Free Locks. In 29th International Conference on Principles of Distributed Systems (OPODIS 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 361, pp. 17:1-17:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.OPODIS.2025.17

Author Details

Hagit Attiya
  • Technion - Israel Institute of Technology, Haifa, Israel
Panagiota Fatourou
  • FORTH ICS, Heraklion, Greece
  • Department of Computer Science, University of Crete, Heraklion, Greece
Eleftherios Kosmas
  • Hellenic Mediterranean University, Chania, Greece
Yuanhao Wei
  • University of British Columbia, Vancouver, Canada

Funding

  • Attiya, Hagit: Supported by the Israel Science Foundation (22/1425 and 25/1849).
  • Fatourou, Panagiota: Supported by the Hellenic Foundation for Research and Innovation (HFRI) under the "Second Call for HFRI Research Projects to support Faculty Members and Researchers" (Project: PERSIST, number: 3684), and by the Greek Ministry of Education, Religious Affairs and Sports call SUB 1.1 - Research Excellence Partnerships (Project: HARSH, code: YΠ 3TA-0560901), implemented through the National Recovery and Resilience Plan Greece 2.0 and funded by the European Union - NextGenerationEU.
  • Kosmas, Eleftherios: Supported by the Hellenic Foundation for Research and Innovation (HFRI) under the "Second Call for HFRI Research Projects to support Faculty Members and Researchers" (project number: 3684).

References

  1. Hagit Attiya, Ohad Ben-Baruch, Panagiota Fatourou, Danny Hendler, and Eleftherios Kosmas. Tracking in order to recover - detectable recovery of lock-free data structures. In Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), SPAA '20', pages 503-505, New York, NY, USA, 2020. Association for Computing Machinery. URL: https://doi.org/10.1145/3350755.3400257.
  2. Hagit Attiya, Ohad Ben-Baruch, Panagiota Fatourou, Danny Hendler, and Eleftherios Kosmas. Detectable recovery of lock-free data structures. In Proceedings of the 27th ACM Symposium on Principles and Practice of Parallel Programming, PPoPP '22, pages 262-277, New York, NY, USA, 2022. Association for Computing Machinery. URL: https://doi.org/10.1145/3503221.3508444.
  3. Hagit Attiya, Ohad Ben-Baruch, Panagiota Fatourou, Danny Hendler, and Eleftherios Kosmas. Tracking in order to recover: Detectable recovery of lock-free data structures, 2022. Google Scholar
  4. Hagit Attiya, Ohad Ben-Baruch, and Danny Hendler. Nesting-safe recoverable linearizability: Modular constructions for non-volatile memory. In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, PODC 2018, Egham, United Kingdom, July 23-27, 2018, pages 7-16, 2018. URL: https://doi.org/10.1145/3212734.3212753.
  5. Greg Barnes. A method for implementing lock-free shared-data structures. In Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA '93, Velen, Germany, June 30 - July 2, 1993, pages 261-270, 1993. URL: https://doi.org/10.1145/165231.165265.
  6. Naama Ben-David, Guy E Blelloch, Michal Friedman, and Yuanhao Wei. Delay-free concurrency on faulty persistent memory. In The 31st ACM Symposium on Parallelism in Algorithms and Architectures, pages 253-264, 2019. URL: https://doi.org/10.1145/3323165.3323187.
  7. Naama Ben-David, Guy E. Blelloch, and Yuanhao Wei. Making concurrent algorithms detectable. CoRR, abs/1806.04780, 2018. URL: https://arxiv.org/abs/1806.04780.
  8. Naama Ben-David, Guy E Blelloch, and Yuanhao Wei. Lock-free locks revisited. In Proceedings of the 27th ACM Symposium on Principles and Practice of Parallel Programming, pages 278-293, 2022. URL: https://doi.org/10.1145/3503221.3508433.
  9. Ryan Berryhill, Wojciech M. Golab, and Mahesh Tripunitara. Robust shared objects for non-volatile main memory. In 19th International Conference on Principles of Distributed Systems, OPODIS 2015, December 14-17, 2015, Rennes, France, pages 20:1-20:17, 2015. URL: https://doi.org/10.4230/LIPIcs.OPODIS.2015.20.
  10. Stefan Bodenmüller, John Derrick, Brijesh Dongol, Gerhard Schellhorn, and Heike Wehrheim. A fully verified persistency library. In Verification, Model Checking, and Abstract Interpretation (VMCAI), pages 26-47, 2024. URL: https://doi.org/10.1007/978-3-031-50521-8_2.
  11. Wentao Cai, Haosen Wen, H. Alan Beadle, Chris Kjellqvist, Mohammad Hedayati, and Michael L. Scott. Understanding and optimizing persistent memory allocation. In Proceedings of the 2020 ACM SIGPLAN International Symposium on Memory Management, ISMM 2020, pages 60-73, New York, NY, USA, 2020. Association for Computing Machinery. URL: https://doi.org/10.1145/3381898.3397212.
  12. Shimin Chen and Qin Jin. Persistent b+-trees in non-volatile main memory. PVLDB, 8(7):786-797, 2015. URL: https://doi.org/10.14778/2752939.2752947.
  13. Kyeongmin Cho, Seungmin Jeon, Azalea Raad, and Jeehoon Kang. Memento: A framework for detectable recoverability in persistent memory. Proceedings of the ACM on Programming Languages, PLDI:292-317, 2023. URL: https://doi.org/10.1145/3591232.
  14. Joel Coburn, Adrian M. Caulfield, Ameen Akel, Laura M. Grupp, Rajesh K. Gupta, Ranjit Jhala, and Steven Swanson. Nv-heaps: making persistent objects fast and safe with next-generation, non-volatile memories. In Proceedings of the 16th International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS 2011, Newport Beach, CA, USA, March 5-11, 2011, pages 105-118, 2011. URL: https://doi.org/10.1145/1950365.1950380.
  15. Marc A De Kruijf, Karthikeyan Sankaralingam, and Somesh Jha. Static analysis and compiler design for idempotent processing. In Proceedings of the 33rd ACM Conference on Programming Language Design and Implementation, pages 475-486, 2012. URL: https://doi.org/10.1145/2254064.2254120.
  16. Sergey Egorov, Gregory Chockler, Brijesh Dongol, Dan O'Keeffe, and Sadegh Keshavarzi. Mangosteen: Fast transparent durability for linearizable applications using NVM. In USENIX Annual Technical Conference (ATC), 2024. Google Scholar
  17. Panagiota Fatourou, Nikolaos D. Kallimanis, and Eleftherios Kosmas. The performance power of software combining in persistence. In Proceedings of the 27th ACM Symposium on Principles and Practice of Parallel Programming, PPoPP '22, pages 337-352, New York, NY, USA, 2022. Association for Computing Machinery. URL: https://doi.org/10.1145/3503221.3508426.
  18. Panagiota Fatourou, Elias Papavasileiou, and Eric Ruppert. Persistent non-blocking binary search trees supporting wait-free range queries. In Proc. 31st ACM on Symposium on Parallelism in Algorithms and Architectures, pages 275-286, 2019. URL: https://doi.org/10.1145/3323165.3323197.
  19. Michal Friedman, Naama Ben-David, Yuanhao Wei, Guy E. Blelloch, and Erez Petrank. Nvtraverse: In nvram data structures, the destination is more important than the journey. In Proceedings of the 41st ACM Conference on Programming Language Design and Implementation, PLDI 2020, pages 377-392, New York, NY, USA, 2020. Association for Computing Machinery. URL: https://doi.org/10.1145/3385412.3386031.
  20. Michal Friedman, Maurice Herlihy, Virendra J. Marathe, and Erez Petrank. A persistent lock-free queue for non-volatile memory. In Proceedings of the 23rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2018, Vienna, Austria, February 24-28, 2018, pages 28-40, 2018. URL: https://doi.org/10.1145/3178487.3178490.
  21. Michal Friedman, Erez Petrank, and Pedro Ramalhete. Mirror: Making lock-free data structures persistent. In Proceedings of the 42nd ACM Conference on Programming Language Design and Implementation, PLDI 2021, pages 1218-1232, New York, NY, USA, 2021. Association for Computing Machinery. URL: https://doi.org/10.1145/3453483.3454105.
  22. Michal Friedman, Erez Petrank, and Pedro Ramalhete. Mirror: making lock-free data structures persistent. In Proceedings of the 42nd ACM Conference on Programming Language Design and Implementation, pages 1218-1232, 2021. URL: https://doi.org/10.1145/3453483.3454105.
  23. Maurice Herlihy. Wait-free synchronization. ACM Transactions on Programming Languages and Systems (TOPLAS), 13(1):124-149, 1991. URL: https://doi.org/10.1145/114005.102808.
  24. Maurice Herlihy. A methodology for implementing highly concurrent data objects. ACM Transactions on Programming Languages and Systems (TOPLAS), 15(5):745-770, 1993. URL: https://doi.org/10.1145/161468.161469.
  25. Maurice Herlihy and J. Eliot B. Moss. Transactional memory: Architectural support for lock-free data structures. SIGARCH Comput. Archit. News, 21(2):289-300, May 1993. URL: https://doi.org/10.1145/165123.165164.
  26. Peter Zilahy Ingerman. Thunks: a way of compiling procedure statements with some comments on procedure declarations. Communications of the ACM, 4(1):55-58, 1961. URL: https://doi.org/10.1145/366062.366084.
  27. Joseph Izraelevitz, Hammurabi Mendes, and Michael L. Scott. Linearizability of persistent memory objects under a full-system-crash failure model. In Distributed Computing - 30th International Symposium, DISC 2016, Paris, France, September 27-29, 2016. Proceedings, pages 313-327, 2016. URL: https://doi.org/10.1007/978-3-662-53426-7_23.
  28. Joseph Izraelevitz, Hammurabi Mendes, and Michael L. Scott. Linearizability of persistent memory objects under a full-system-crash failure model. In Proceedings of the 30th International Symposium of Distributed Computing, volume LNCS 9888, pages 313-327. Springer, 2016. URL: https://doi.org/10.1007/978-3-662-53426-7_23.
  29. Maged M. Michael and Michael L. Scott. Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. In Proceedings of the 15th ACM Symposium on Principles of Distributed Computing, Philadelphia, Pennsylvania, USA, May 23-26, 1996, pages 267-275, 1996. URL: https://doi.org/10.1145/248052.248106.
  30. Ravi Rajwar and James R Goodman. Speculative lock elision: Enabling highly concurrent multithreaded execution. In Proceedings. 34th ACM/IEEE International Symposium on Microarchitecture. MICRO-34, pages 294-305. IEEE, 2001. URL: https://doi.org/10.1109/MICRO.2001.991127.
  31. Ravi Rajwar and James R Goodman. Transactional lock-free execution of lock-based programs. ACM SIGOPS Operating Systems Review, 36(5):5-17, 2002. URL: https://doi.org/10.1145/605397.605399.
  32. Pedro Ramalhete, Andreia Correia, Pascal Felber, and Nachshon Cohen. Onefile: A wait-free persistent transactional memory. In 49th Annual IEEE/IFIP Conference on Dependable Systems and Networks, DSN 2019, Portland, OR, USA, June 24-27, 2019, pages 151-163. IEEE, 2019. URL: https://doi.org/10.1109/DSN.2019.00028.
  33. Gal Sela and Erez Petrank. Durable Queues: The Second Amendment, pages 385-397. Association for Computing Machinery, New York, NY, USA, 2021. URL: https://doi.org/10.1145/3409964.3461791.
  34. Maurice Herlihy & Nir Shavit. The art of multiprocessor programming. Morgan Kaufmann, 2008. Google Scholar
  35. John Turek, Dennis Shasha, and Sundeep Prakash. Locking without blocking: making lock based concurrent data structure algorithms nonblocking. In Proceedings of the 11th ACM Symposium on Principles of database systems, pages 212-222, 1992. URL: https://doi.org/10.1145/137097.137873.
  36. Yuanhao Wei, Naama Ben-David, Michal Friedman, Guy E Blelloch, and Erez Petrank. FliT: a library for simple and efficient persistent algorithms. In Proceedings of the 27th ACM Symposium on Principles and Practice of Parallel Programming, pages 309-321, 2022. URL: https://doi.org/10.1145/3503221.3508436.
  37. Yoav Zuriel, Michal Friedman, Gali Sheffi, Nachshon Cohen, and Erez Petrank. Efficient lock-free durable sets. Proc. ACM Program. Lang., 3(OOPSLA), October 2019. URL: https://doi.org/10.1145/3360554.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact