The limits of helping in non-volatile memory data structures

DOI10.1007/978-3-031-21017-4_6MaRDI QIDQ6155236zbMATH OpenOpenAlexFDO

Authors Ohad Ben-Baruch, Srivatsan Ravi

Publication date 12 June 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-21017-4_6

Mathematics Subject Classification ID

Distributed systems (68M14) Data structures (68P05)

Recommendations

• Robust shared objects for non-volatile main memory
• Nesting-safe recoverable linearizability: modular constructions for non-volatile memory
• Verifying correctness of persistent concurrent data structures: a sound and complete method
• Strict linearizability and abstract atomicity
• Recovering shared objects without stable storage

Cites work

• scientific article; zbMATH DE number 1179121 (Why is no real title available?)
• scientific article; zbMATH DE number 2006660 (Why is no real title available?)
• Linearizable implementations do not suffice for randomized distributed computation
• Nontrivial and universal helping for wait-free queues and stacks
• Robust shared objects for non-volatile main memory

Cited in

(4)

• Denseness of volatile and nonvolatile sequences of functions
• Nesting-safe recoverable linearizability: modular constructions for non-volatile memory
• Robust shared objects for non-volatile main memory
• Verifying correctness of persistent concurrent data structures

This page was built for publication: The limits of helping in non-volatile memory data structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6155236)