2026-08-16T16:42:53Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:14862 2024-03-06T10:55:02Z ddc:004 open_access

Brief Announcement: Crystalline: Fast and Memory Efficient Wait-Free Reclamation Nikolaev, Ruslan Ravindran, Binoy memory reclamation wait-free reference counting hazard pointers 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Ruslan Nikolaev and Binoy Ravindran 2021 Is Part Of LIPIcs, Volume 209, 35th International Symposium on Distributed Computing (DISC 2021) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.DISC.2021.60 urn:nbn:de:0030-drops-148626 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.60 eng https://creativecommons.org/licenses/by/4.0/legalcode