Data Structure Engineering For Byte-Addressable Non-Volatile Memory
Authors:
Open Access
- 9 May 2017
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1759-1764
Abstract
Storage Class Memory (SCM) is emerging as a viable alternative to traditional DRAM, alleviating its scalability limits, both in terms of capacity and energy consumption, while being non-volatile. Hence, SCM has the potential to become a universal memory, blurring well-known storage hierarchies. However, along with opportunities, SCM brings many challenges. In this tutorial we will dissect SCM challenges and provide an in-depth view of existing programming models that circumvent them, as well as novel data structures that stem from these models. We will also elaborate on fail-safety testing challenges -- an often overlooked, yet important topic. Finally, we will discuss SCM emulation techniques for end-to-end testing of SCM-based software components. In contrast to surveys investigating the use of SCM in database systems, this tutorial is designed as a programming guide for researchers and professionals interested in leveraging SCM in database systems.Keywords
This publication has 26 references indexed in Scilit:
- Persistent B + -trees in non-volatile main memoryProceedings of the VLDB Endowment, 2015
- REWINDProceedings of the VLDB Endowment, 2015
- AtlasACM SIGPLAN Notices, 2014
- Write-limited sorts and joins for persistent memoryProceedings of the VLDB Endowment, 2014
- NV-HeapsACM SIGPLAN Notices, 2011
- NV-HeapsACM SIGARCH Computer Architecture News, 2011
- MnemosyneACM SIGARCH Computer Architecture News, 2011
- ValgrindACM SIGPLAN Notices, 2007
- Making B+- trees cache conscious in main memoryACM SIGMOD Record, 2000
- The log-structured merge-tree (LSM-tree)Acta Informatica, 1996