License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.DISC.2021.60
URN: urn:nbn:de:0030-drops-148626
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2021/14862/
Go to the corresponding LIPIcs Volume Portal

Nikolaev, Ruslan ; Ravindran, Binoy

Brief Announcement: Crystalline: Fast and Memory Efficient Wait-Free Reclamation

pdf-format:
LIPIcs-DISC-2021-60.pdf (0.6 MB)

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.

BibTeX - Entry

@InProceedings{nikolaev_et_al:LIPIcs.DISC.2021.60,
  author =	{Nikolaev, Ruslan and Ravindran, Binoy},
  title =	{{Brief Announcement: Crystalline: Fast and Memory Efficient Wait-Free Reclamation}},
  booktitle =	{35th International Symposium on Distributed Computing (DISC 2021)},
  pages =	{60:1--60:4},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-210-5},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{209},
  editor =	{Gilbert, Seth},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2021/14862},
  URN =		{urn:nbn:de:0030-drops-148626},
  doi =		{10.4230/LIPIcs.DISC.2021.60},
  annote =	{Keywords: memory reclamation, wait-free, reference counting, hazard pointers}
}

Keywords: memory reclamation, wait-free, reference counting, hazard pointers
Collection: 35th International Symposium on Distributed Computing (DISC 2021)
Issue Date: 2021
Date of publication: 04.10.2021
Supplementary Material: Software (Source Code): https://github.com/rusnikola/wfsmr

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI