Understanding and optimizing persistent memory allocation
Understanding and optimizing persistent memory allocation
复制标题
DOI：
10.1145/3381898.3397212
复制
发表时间：
2020-03
期刊：
影响因子：
--
通讯作者：
Wentao Cai;Haosen Wen;H. A. Beadle;Chris Kjellqvist;Mohammad Hedayati;M. Scott
中科院分区：
文献类型：
--
作者：
Wentao Cai;Haosen Wen;H. A. Beadle;Chris Kjellqvist;Mohammad Hedayati;M. Scott
快速、密集、可字节寻址的非易失性存储器的激增表明，在程序运行甚至进程和系统崩溃时，数据可能会以富含指针的“内存中”格式保存。为了完全通用，此类数据需要动态内存分配，虽然分配器原则上可以“滚动到”每个数据结构中，但希望使其成为单独的抽象。为此，我们引入可恢复性（持久分配器的正确性标准）以及满足此标准的非阻塞分配器 Ralloc。 Ralloc基于Leite和Rocha的LRMalloc，具有三项关键创新。首先，我们在正常操作期间保留足够的信息，以便在整个系统崩溃后正确重建堆。我们的重建机制执行垃圾收集（GC）来识别和修复任何由故障引起的内存泄漏。其次，我们引入过滤函数的概念，它识别持久块内指针的位置，以减轻保守 GC 的限制。第三，为了允许持久区域映射到任意地址，我们对数据和元数据都使用位置无关（基于偏移）的指针。实验表明，Ralloc 与 Makalu（最先进的基于锁的持久分配器）以及 LRMalloc 和 JEMalloc 等瞬态分配器相比，具有性能竞争力。特别是，对GC和离线元数据重建的依赖使得Ralloc在正常运行期间几乎不需要为持久化付出任何代价。
The proliferation of fast, dense, byte-addressable nonvolatile memory suggests that data might be kept in pointer-rich "in-memory" format across program runs and even process and system crashes. For full generality, such data requires dynamic memory allocation, and while the allocator could in principle be "rolled into" each data structure, it is desirable to make it a separate abstraction. Toward this end, we introduce recoverability, a correctness criterion for persistent allocators, together with a nonblocking allocator, Ralloc, that satisfies this criterion. Ralloc is based on the LRMalloc of Leite and Rocha, with three key innovations. First, we persist just enough information during normal operation to permit correct reconstruction of the heap after a full-system crash. Our reconstruction mechanism performs garbage collection (GC) to identify and remedy any failure-induced memory leaks. Second, we introduce the notion of filter functions, which identify the locations of pointers within persistent blocks to mitigate the limitations of conservative GC. Third, to allow persistent regions to be mapped at an arbitrary address, we employ position-independent (offset-based) pointers for both data and metadata. Experiments show Ralloc to be performance-competitive with both Makalu, the state-of-the-art lock-based persistent allocator, and such transient allocators as LRMalloc and JEMalloc. In particular, reliance on GC and offline metadata reconstruction allows Ralloc to pay almost nothing for persistence during normal operation.