Return
WPAlloc: An Efficient Wear-Leveling-Aware Parallel Allocator for Persistent Memory File Systems
DOI:10.1109/tcad.2025.3642196.png)
Abstract
En 中文
Internet and IoT applications have generated increasing amounts of data that require efficient storage. Many persistent memory (PM) file systems have been designed to handle high-performance storage demands by fully exploiting the senior features of PM. However, PMs suffer from limited write endurance. Existing PM file systems achieve PM wear-leveling by designing wear-leveling-aware allocators. These allocators focus on providing higher balanced writes to PMs while neglecting the overhead. Moreover, they cause serious request conflicts in parallel block requests by multiple threads in modern multiprocessor computer systems. In this article, we propose an efficient wear-leveling-aware parallel allocator, WPAlloc, for PM file systems to achieve wear-leveling of PM and high parallel performance. The essential idea of WPAlloc is to allocate blocks with lower write counters for each allocation request and to provide parallel block allocation and deallocation for multiple threads via one free list per logical processor. WPAlloc consists of two key techniques: the bucket sort-based range management scheme (BRMS) and the parallel allocation and deallocation scheme (PADS). First, we design the BRMS to obtain the less-worn free blocks. Based on BRMS, an online wear range adjustment algorithm has been designed to adjust the wear range dynamically. Then, we present the PADS to avoid request conflicts by multiple threads. We implement WPAlloc based on PMFS. Experimental results show that WPAlloc can reduce the maximum write by 54.2%, 10.2%, and 55.7%, while achieving average performance improvements of 5.68%, 54.18%, and 11.28% compared to PMFS, DWARM, and WASA, respectively.
Keywords:
File system
multiple threads
performance
persistent memory (PM)
wear-leveling
Journal
I
IF:
2.9
Papers:
586
Citations:
9.6K

