Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Haozhe Song

dblp:408/3389 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2024
0009-0005-1520-4932ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Memory systems · 83% Storage systems · 8% Distributed systems · 8%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Memory systems
non-volatile memory
0.812024
PMAlloc: A Holistic Approach to Improving Persistent Memory Allocation · ACM Trans. Comput. Syst. 2024
Memory systems › non-volatile memory
persistent memory
0.812024
PMAlloc: A Holistic Approach to Improving Persistent Memory Allocation · ACM Trans. Comput. Syst. 2024
Memory systems › non-volatile memory
persistent memory allocation
0.812024
PMAlloc: A Holistic Approach to Improving Persistent Memory Allocation · ACM Trans. Comput. Syst. 2024
Distributed systems
consistency models
0.212024
PMAlloc: A Holistic Approach to Improving Persistent Memory Allocation · ACM Trans. Comput. Syst. 2024
Storage systems
storage reliability
0.212024
PMAlloc: A Holistic Approach to Improving Persistent Memory Allocation · ACM Trans. Comput. Syst. 2024

Methods — techniques the papers use, named apart from their topics

two-phase deallocation · 0.8cache line flush elimination · 0.8bookkeeping log · 0.8
YearPublicationVenuePosition
2024 PMAlloc: A Holistic Approach to Improving Persistent Memory Allocation
abstract
Persistent memory allocation is a fundamental building block for developing high-performance and in-memory applications. Existing persistent memory allocators suffer from many performance issues. First, they may introduce repeated cache line flushes and small random accesses in persistent memory for their poor heap metadata management. Second, they use static slab segregation resulting in a dramatic increase in memory consumption when allocation request size is changed. Third, they are not aware of NUMA effect, leading to remote persistent memory accesses in memory allocation and deallocation processes. In this article, we design a novel allocator, named PMAlloc, to solve the above issues simultaneously. (1) PMAlloc eliminates cache line reflushes by mapping contiguous data blocks in slabs to interleaved metadata entries stored in different cache lines. (2) It writes small metadata units to a persistent bookkeeping log in a sequential pattern to remove random heap metadata accesses in persistent memory. (3) Instead of using static slab segregation, it supports slab morphing, which allows slabs to be transformed between size classes to significantly improve slab usage. (4) It uses a local-first allocation policy to avoid allocating remote memory blocks. And it supports a two-phase deallocation mechanism including recording and synchronization to minimize the number of remote memory access in the deallocation. PMAlloc is complementary to the existing consistency models. Results on six benchmarks demonstrate that PMAlloc improves the performance of state-of-the-art persistent memory allocators by up to 6.4× and 57× for small and large allocations, respectively. PMAlloc with NUMA optimizations brings a 2.9× speedup in multi-socket evaluation and is up to 36× faster than other persistent memory allocators. Using PMAlloc reduces memory usage by up to 57.8%. Besides, we integrate PMAlloc in a persistent FPTree. Compared to the state-of-the-art allocators, PMAlloc improves the performance of this application by up to 3.1×.
Zheng Dang, Shuibing He, Xuechen Zhang 0001, Peiyi Hong, Zhenxin Li, Haozhe Song, Xian-He Sun, Gang Chen 0001
ACM Trans. Comput. Syst.7