Consistent and Durable Data Structures for Non-Volatile Byte-Addressable Memory

By Shivaram Venkataraman, Niraj Tolia, Parthasarathy Ranganathan, Roy H. Campbell. USENIX Conference on File and Storage Technologies, 2011

411 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/24724ad8962a9e04eb496fddaefe9708f6960601

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Jian Yang
2. Steven Swanson
3. Jun Yang
4. Joseph Izraelevitz
5. Juno Kim
6. Kiwan Maeng
7. Shimin Chen
8. Q. Wei

Citations in the corpus

• Trends in big data analytics (2014, background): “From the perspective of algorithm design and related data structures, non-volatility could push towards alternate, optimizeddesigns and implementations of index structures, [22], key-value stores [91], database and file systems [27,12], all integral components of bigdata analytics.”
• SCMFS: A file system for Storage Class Memory (2011, methodology): “A data structure level approach to achieve data consistency on non-volatile memory is described in [25].”
• Persistent B+-Trees in Non-Volatile Main Memory (2015, background): “As a result, there are widespread interests in the research community and in the industry to consider incorporating NVM technologies to substitute or complement DRAM as the main memory in future computer systems [5, 9, 36, 15, 26, 7, 31, 8, 33, 29, 20].”
• NV-Tree: Reducing Consistency Cost for NVM-based Single Level Systems (2015, methodology): “Alternatively, without modifying existing hardware, we can use the sequence of {MFENCE, CLFLUSH, MFENCE} instruction (referred to flush in the rest of this paper) to form ordered memory writes [53].”
• An Empirical Guide to the Behavior and Use of Scalable Persistent Memory (2019, background): “Various authors have built intricate NVM data structures for logging, data storage, and transaction processing [3,4,10,11,17,23,24, 27,30,35,38,39,41,45,46,50,57].”
• FPTree: A Hybrid SCM-DRAM Persistent and Concurrent B-Tree for Storage Class Memory (2016, methodology): “In this context, Venkataraman et al. [24] proposed the CDDS B-Tree , a persistent and concurrent B-Tree that relies on versioning to achieve consistency.”
• Alpaca: intermittent execution without checkpoints (2017, background): “…in non-volatile memory, and for building consistent memory and file systems out of byte-addressable non-volatile memory [Coburn et al. 2011; Condit et al. 2009; Doshi and Varman 2012; Dulloor et al. 2014; Moraru et al. 2013; Narayanan and Hodson 2012; Venkataraman et al. 2011; Volos et al. 2011].”