LIPIcs.DISC.2021.60.pdf
- Filesize: 0.56 MB
- 4 pages
Document
Brief Announcement: Crystalline: Fast and Memory Efficient Wait-Free Reclamation
Authors
Binoy Ravindran 
-
Part of:
Volume:
35th International Symposium on Distributed Computing (DISC 2021)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Symposium on Distributed Computing (DISC) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2021-10-04
File
Document Identifiers
Author Details
Acknowledgements
We thank the anonymous reviewers for their invaluable feedback.
Cite AsGet BibTex
Ruslan Nikolaev and Binoy Ravindran. Brief Announcement: Crystalline: Fast and Memory Efficient Wait-Free Reclamation. In 35th International Symposium on Distributed Computing (DISC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 209, pp. 60:1-60:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
https://doi.org/10.4230/LIPIcs.DISC.2021.60
https://doi.org/10.4230/LIPIcs.DISC.2021.60
Abstract
We present a new wait-free memory reclamation scheme, Crystalline, that simultaneously addresses the challenges of high performance, high memory efficiency, and wait-freedom. Crystalline guarantees complete wait-freedom even when threads are dynamically recycled, asynchronously reclaims memory in the sense that any thread can reclaim memory retired by any other thread, and ensures (an almost) balanced reclamation workload across all threads. The latter two properties result in Crystalline’s high performance and high memory efficiency, a difficult trade-off for most existing schemes. Our evaluations show that Crystalline exhibits outstanding scalability and memory efficiency, and achieves superior throughput than state-of-the-art reclamation schemes as the number of threads grows.
Subject Classification
ACM Subject Classification
- Theory of computation → Concurrent algorithms
Keywords
- memory reclamation
- wait-free
- reference counting
- hazard pointers
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads
References
- Daniel Anderson, Guy E. Blelloch, and Yuanhao Wei. Concurrent Deferred Reference Counting with Constant-Time Overhead. In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, PLDI '21, pages 526-541. ACM, 2021. URL: https://doi.org/10.1145/3453483.3454060.
- Nachshon Cohen. Every Data Structure Deserves Lock-free Memory Reclamation. Proc. ACM Program. Lang., 2(OOPSLA):143:1-143:24, 2018. URL: https://doi.org/10.1145/3276513.
- Andreia Correia, Pedro Ramalhete, and Pascal Felber. OrcGC: Automatic Lock-Free Memory Reclamation. In Proceedings of the 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP '21, pages 205-218. ACM, 2021. URL: https://doi.org/10.1145/3437801.3441596.
- Keir Fraser. Practical lock-freedom. Technical report, University of Cambridge, Computer Laboratory, 2004. URL: http://www.cl.cam.ac.uk/techreports/UCAM-CL-TR-579.pdf.
- Jeehoon Kang and Jaehwang Jung. A Marriage of Pointer- and Epoch-Based Reclamation. In Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI '20, pages 314-328. ACM, 2020. URL: https://doi.org/10.1145/3385412.3385978.
- Maged M. Michael. Hazard pointers: safe memory reclamation for lock-free objects. IEEE Transactions on Parallel and Distributed Systems, 15(6):491-504, June 2004. URL: https://doi.org/10.1109/TPDS.2004.8.
- Maged M. Michael and Michael L. Scott. Correction of a Memory Management Method for Lock-Free Data Structures. Technical report, University of Rochester, USA, 1995. URL: https://www.cs.rochester.edu/u/scott/papers/1995_TR599.pdf.
- Ruslan Nikolaev and Binoy Ravindran. Brief Announcement: Hyaline: Fast and Transparent Lock-Free Memory Reclamation. In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, PODC '19, pages 419-421. ACM, 2019. URL: https://doi.org/10.1145/3293611.3331575.
- Ruslan Nikolaev and Binoy Ravindran. Universal Wait-Free Memory Reclamation. In Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP '20, pages 130-143. ACM, 2020. URL: https://doi.org/10.1145/3332466.3374540.
- Ruslan Nikolaev and Binoy Ravindran. Crystalline: Fast and Memory Efficient Wait-Free Reclamation (full paper, arXiv), 2021. URL: http://arxiv.org/abs/2108.02763.
- Ruslan Nikolaev and Binoy Ravindran. Snapshot-Free, Transparent, and Robust Memory Reclamation for Lock-Free Data Structures. In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, PLDI '21, pages 987-1002. ACM, 2021. URL: https://doi.org/10.1145/3453483.3454090.
- Pedro Ramalhete and Andreia Correia. Brief Announcement: Hazard Eras - Non-Blocking Memory Reclamation. In Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '17, pages 367-369. ACM, 2017. URL: https://doi.org/10.1145/3087556.3087588.
- Gali Sheffi, Maurice Herlihy, and Erez Petrank. VBR: Version Based Reclamation. In Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '21, pages 443-445. ACM, 2021. URL: https://doi.org/10.1145/3409964.3461817.
- Ajay Singh, Trevor Brown, and Ali Mashtizadeh. NBR: Neutralization Based Reclamation. In Proceedings of the 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP '21, pages 175-190. ACM, 2021. URL: https://doi.org/10.1145/3437801.3441625.
- John D. Valois. Lock-free Linked Lists Using Compare-and-swap. In Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing, PODC '95, pages 214-222. ACM, 1995. URL: https://doi.org/10.1145/224964.224988.
- Haosen Wen, Joseph Izraelevitz, Wentao Cai, H. Alan Beadle, and Michael L. Scott. Interval-based Memory Reclamation. In Proceedings of the 23rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP '18, pages 1-13. ACM, 2018. URL: https://doi.org/10.1145/3178487.3178488.