FFCCD: Fence-Free Crash-Consistent Concurrent Defragmentation for Persistent Memory

9Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Persistent Memory (PM) is increasingly supplementing or substituting DRAM as main memory. Prior work have focused on reusability and memory leaks of persistent memory but have not addressed a problem amplifed by persistence, persistent memory fragmentation, which refers to the continuous worsening of fragmentation of persistent memory throughout its usage. This paper reveals the challenges and proposes the frst systematic crash-consistent solution, Fence-Free Crash-consistent Concurrent Defragmentation (FFCCD). FFCCD resues persistent pointer format, root nodes and typed allocation provided by persistent memory programming model to enable concurrent defragmentation on PM. FFCCD introduces architecture support for concurrent defragmentation that enables a fence-free design and fast read barrier, reducing two major overheads of defragmenting persistent memory. The techniques is effective (28-73% fragmentation reduction) and fast (4.1% execution time overhead).

Cite

CITATION STYLE

APA

Xu, Y., Ye, C., Solihin, Y., & Shen, X. (2022). FFCCD: Fence-Free Crash-Consistent Concurrent Defragmentation for Persistent Memory. In Proceedings - International Symposium on Computer Architecture (pp. 274–288). Institute of Electrical and Electronics Engineers Inc. https://doi.org/10.1145/3470496.3527406

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free