Flat-Combining-Based Persistent Data Structures for Non-volatile Memory

Authors:

Publisher website

9 November 2021

book chapter
Published by Springer Nature

p. 505-509
DOI:10.1007/978-3-030-91081-5_38

Abstract

No abstract available

Keywords

All Related Versions

This publication has 8 references indexed in Scilit:

Flat-Combining-Based Persistent Data Structures for Non-volatile Memory
2021
Delay-Free Concurrency on Faulty Persistent Memory
2019
OneFile: A Wait-Free Persistent Transactional Memory
2019
Romulus
2018
A persistent lock-free queue for non-volatile memory
ACM SIGPLAN Notices, 2018
Linearizability of Persistent Memory Objects Under a Full-System-Crash Failure Model
2016
Flat combining and the synchronization-parallelism tradeoff
2010
A scalable lock-free stack algorithm
Journal of Parallel and Distributed Computing, 2010