Towards Buffer Management with Tiered Main Memory
Name
3639286.pdf
Size
864.33 KB
Format
Adobe PDF
Checksum (MD5)
e0326ce9e5636571a411f6b2e1ee7368
Author(s)
Hao, Xiangpeng
Zhou, Xinjing
Yu, Xiangyao
Stonebraker, Michael
Date Issued
March 12, 2024
Journal
Proceedings of the ACM on Management of Data
Publisher
Association for Computing Machinery
Citation
Xiangpeng Hao, Xinjing Zhou, Xiangyao Yu, and Michael Stonebraker. 2024. Towards Buffer Management
with Tiered Main Memory. Proc. ACM Manag. Data 2, 1 (SIGMOD), Article 31 (February 2024), 26 pages.
Version
Final published version
Abstract
The scaling of per-GB DRAM cost has slowed down in recent years. Recent research has suggested that adding remote memory to a system can further reduce the overall memory cost while maintaining good performance.
Remote memory (i.e., tiered memory), connected to host servers via high-speed interconnect protocols such as RDMA and CXL, is expected to deliver 100x (less than 1us) lower latency than SSD and be more cost-effective than local DRAM through pooling or adopting cheaper memory technologies.
Tiered memory opens up a large number of potential use cases within database systems. But previous work has only explored limited ways of using tiered memory. Our study provides a systematic study for DBMS to build tiered memory buffer management with respect to a wide range of hardware performance characteristics. Specifically, we study five different indexing designs that leverage remote memory in different ways and evaluate them through a wide range of metrics including performance, tiered-memory latency sensitivity, and cost-effectiveness.
In addition, we propose a new memory provisioning strategy that allocates an optimal amount of local and remote memory for a given workload. Our evaluations show that while some designs achieve higher performance than others, no design can win in all measured dimensions.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1145/3639286
