Robust shared objects for non-volatile main memory

DOI10.4230/LIPICS.OPODIS.2015.20MaRDI QIDQ5363811zbMATH OpenOpenAlexFDO

Authors Ryan Berryhill, Wojciech Golab, Mahesh Tripunitara

Publication date 29 September 2017

Full work available at URL https://dblp.uni-trier.de/db/conf/opodis/opodis2015.html#BerryhillGT15

zbMATH Keywords

data structuresconcurrencyrecoverynon-volatile main memory

Mathematics Subject Classification ID

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

Recommendations

• Nesting-safe recoverable linearizability: modular constructions for non-volatile memory
• The limits of helping in non-volatile memory data structures
• Verifying correctness of persistent concurrent data structures: a sound and complete method
• Recoverable mutual exclusion with abortability
• Recovering shared objects without stable storage

Cited in

(8)

• When is recoverable consensus harder than consensus?
• The limits of helping in non-volatile memory data structures
• Determining recoverable consensus numbers
• scientific article; zbMATH DE number 7577571 (Why is no real title available?)
• Nesting-safe recoverable linearizability: modular constructions for non-volatile memory
• Brief Announcement: Efficient Recoverable Writable-CAS
• Efficient multi-word compare and swap
• Verifying correctness of persistent concurrent data structures

This page was built for publication: Robust shared objects for non-volatile main memory

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