2026-07-21T19:38:36Z https://drops.dagstuhl.de/oai

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

Fast Nonblocking Persistence for Concurrent Data Structures Cai, Wentao Wen, Haosen Maksimovski, Vladimir Du, Mingzhe Sanna, Rafaello Abdallah, Shreif Scott, Michael L. Persistent Memory Nonblocking Progress Buffered Durable Linearizability We present a fully lock-free variant of our recent Montage system for persistent data structures. The variant, nbMontage, adds persistence to almost any nonblocking concurrent structure without introducing significant overhead or blocking of any kind. Like its predecessor, nbMontage is buffered durably linearizable: it guarantees that the state recovered in the wake of a crash will represent a consistent prefix of pre-crash execution. Unlike its predecessor, nbMontage ensures wait-free progress of the persistence frontier, thereby bounding the number of recent updates that may be lost on a crash, and allowing a thread to force an update of the frontier (i.e., to perform a sync operation) without the risk of blocking. As an extra benefit, the helping mechanism employed by our wait-free sync significantly reduces its latency. Performance results for nonblocking queues, skip lists, trees, and hash tables rival custom data structures in the literature - dramatically faster than achieved with prior general-purpose systems, and generally within 50% of equivalent non-persistent structures placed in DRAM. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Wentao Cai and Haosen Wen and Vladimir Maksimovski and Mingzhe Du and Rafaello Sanna and Shreif Abdallah and Michael L. Scott 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.14 urn:nbn:de:0030-drops-148169 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.14 eng https://creativecommons.org/licenses/by/4.0/legalcode