ACEing the Bufferpool Management Paradigm for Modern Storage Devices
Tarikul Islam Papon, Manos Athanassoulis
摘要
Over the past few decades, solid-state drives (SSDs) have been replacing hard disk drives (HDDs) due to their faster reads and writes, as well as their superior random access performance. Further, when compared to HDDs, SSDs have two fundamentally different properties: (i) read/write asymmetry (writes are slower than reads) and (ii) access concurrency (multiple I/Os can be executed in parallel to saturate the device bandwidth). However, several database operators are designed without considering storage asymmetry and concurrency resulting in device underutilization, which is typically addressed opportunistically by device-specific tuning during deployment. As a key example and the focus of our work, the bufferpool management of a Database Management System (DBMS) is tightly connected to the underlying storage device, yet, state-of-the-art approaches treat reads and writes equally, and do not expressly exploit the device concurrency, leading to subpar performance.In this paper, we propose a new Asymmetry & Concurrency-aware bufferpool management (ACE) that batches writes based on device concurrency and performs them in parallel to amortize the asymmetric write cost. In addition, ACE performs parallel prefetching to exploit the device’s read concurrency. ACE does not modify the existing bufferpool replacement policy, rather, it is a wrapper that can be integrated with any replacement policy. We implement ACE in PostgreSQL and evaluate its benefits using a synthetic benchmark and TPC-C for several popular eviction policies (Clock Sweep, LRU, CFLRU, LRU-WSR). The ACE counterparts of all four policies lead to significant performance improvements, exhibiting up to 32.1% lower runtime for mixed workloads (33.8% for write-intensive TPC-C transactions) with a negligible increase in total disk writes and buffer misses, which shows that incorporating asymmetry and concurrency in algorithm design leads to more faithful storage modeling and, ultimately, to better device utilization.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了最后一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper5
- CAVE: Concurrency-Aware Graph Processing on SSDsTarikul Islam Papon, Taishan Chen, Shuo Zhang, Manos AthanassoulisSIGMOD 2024 · 被引用 11 次
- Write-Aware Timestamp Tracking: Effective and Efficient Page Replacement for Modern HardwareDemian E. Vöhringer, Viktor LeisVLDB 2023 · 被引用 11 次
- Ratel: Optimizing Holistic Data Movement to Fine-tune 100B Model on a Consumer GPUChangyue Liao, Mo Sun, Zihan Yang, Jun Xie 等ICDE 2025 · 被引用 4 次
- CAM: Asynchronous GPU-Initiated, CPU-Managed SSD Management for Batching Storage AccessZiyu Song, Jie Zhang, Jie Sun, Mo Sun 等ICDE 2025 · 被引用 4 次
- Predictive Translation: High-Performance Buffer Management Without the Trade-OffsMichael Zinsmeister, Lam-Duy Nguyen, Viktor Leis, Thomas NeumannSIGMOD 2026 · 被引用 3 次
它引用的顶会 Paper3
- LB+-Trees: Optimizing Persistent Index Performance on 3DXPoint MemoryJihang Liu, Shimin Chen, Lujun WangVLDB 2020 · 被引用 69 次
- Toward a Better Understanding and Evaluation of Tree Structures on Flash SSDsDiego Didona, Nikolas Ioannou, Radu Stoica, Kornilios KourtisVLDB 2021 · 被引用 16 次
- Optimizing Databases by Learning Hidden Parameters of Solid State DrivesAarati Kakaraparthy, Jignesh M. Patel, Kwanghyun Park, Brian KrothVLDB 2020 · 被引用 13 次
相关 Paper
- LRU-C: Parallelizing Database I/Os for Flash SSDsBo-Hyun Lee, Mijin An, Sang-Won LeeVLDB 2023 · 被引用 14 次
- Sampling-based Predictive Database Buffer ManagementTheo Vanderkooy, Mohammad Khalaji, Runsheng Benson Guo, Khuzaima DaudjeeVLDB 2025 · 被引用 1 次
- Rearchitecting Buffered I/O in the Era of High-Bandwidth SSDsYekang Zhan, Tianze Wang, Zheng Peng, Haichuan Hu 等FAST 2026
- Avoiding Read Stalls on Flash StorageMijin An, In-Yeong Song, Yong Ho Song, Sang-Won LeeSIGMOD 2022 · 被引用 10 次
- Your Read is Our Priority in Flash StorageMijin An, Soojun Im, Dawoon Jung, Sang Won LeeVLDB 2022 · 被引用 9 次
