Nesting-safe recoverable linearizability: modular constructions for non-volatile memory

DOI10.1145/3212734.3212753MaRDI QIDQ5197661zbMATH OpenOpenAlexFDO

Authors Hagit Attiya, Ohad Ben-Baruch, Danny Hendler

Publication date 19 September 2019

Published in Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3212734.3212753

zbMATH Keywords

concurrencylock-freedommulti-core algorithmsnonblockingshared memorywait-freedom

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Recommendations

• Robust shared objects for non-volatile main memory
• The limits of helping in non-volatile memory data structures
• Recoverable mutual exclusion with abortability
• Recoverable FCFS mutual exclusion with wait-free recovery
• Recovering shared objects without stable storage

Cited in

(7)

• Reducing crash recoverability to reachability
• Robust shared objects for non-volatile main memory
• The limits of helping in non-volatile memory data structures
• The ERA Theorem for Safe Memory Reclamation
• Brief Announcement: Efficient Recoverable Writable-CAS
• When is recoverable consensus harder than consensus?
• Determining recoverable consensus numbers

This page was built for publication: Nesting-safe recoverable linearizability: modular constructions for non-volatile memory

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