arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2307.16693cs.DB
收藏

Pome: 并行化I/O与计算以实现高效的基于LSM树的数据存储

Pome: Parallelizing I/Os and Computations for Efficient LSM-tree-based Data Storage

ShanghaiTech University(上海科技大学)

Yanpeng Hu, Li Zhu, Lei Jia, Chundong Wang

AI总结:

针对LSM树存储系统中压缩操作因同步I/O导致长关键路径的问题,提出Pome,通过解耦计算与I/O并利用io_uring异步I/O及自适应速率限制器,显著提升RocksDB性能。

摘要:

CPU计算和I/O操作是数据存储系统的基础。存储系统通过用户线程进行计算,例如对数据进行排序以保持有序性。它们主要通过系统调用(包括文件写入、读取和fsync)处理I/O,这些由操作系统的内核线程与存储设备执行。如今,基于LSM树的存储系统广泛部署在生产环境中。压缩是LSM树用于维护其分层树状结构的基本操作,通过计算和I/O分别重新排序和重新存储数据。在本文中,我们首先全面检查压缩的过程。我们发现计算和I/O按顺序执行。在重新排序数据后,用户线程等待内核线程完成文件写入和fsync I/O。这些昂贵的同步I/O创建了严重影响LSM树性能的严重长关键路径。为了解决这个问题,我们提出并行化I/O和计算以实现高效的基于LSM树的数据存储(Pome)。Pome通过其新协议将I/O操作移出关键路径,从而在每个压缩中解耦计算和I/O。为此,它利用io_uring执行异步I/O。此外,考虑到加速压缩可能导致的I/O拥塞,Pome集成了自适应I/O速率限制器以实现平滑执行。我们在RocksDB上实现了Pome原型。实验结果表明,Pome显著提高了RocksDB的性能,并优于几种最先进的LSM树变体。

英文摘要:

CPU computations and I/O operations are fundamental to data storage systems. Storage systems conduct computations with their user threads, such as sorting data for orderliness. They handle I/Os mainly through system calls (syscalls) including file write, read, and fsync, which the OS's kernel threads perform with storage devices. Today, LSM-tree-based storage systems are widely deployed in production environments. Compaction is an essential operation that LSM-tree employs to maintain its tiered tree-like structure by re-sorting and re-storing data through computations and I/Os,respectively. In this paper, we first overhaul the procedure of a compaction. We find that computations and I/Os execute in sequential order. After re-sorting data, the user thread waits for a kernel thread to complete file write and fsync I/Os. These costly synchronous I/Os create a severely long critical path that affects the performance of LSM-tree. To address this issue, we propose parallelizing I/Os and computations for efficient LSM-tree-based data storage (Pome). Pome decouples computations from I/Os within each compaction by referring to its new protocol that moves I/O operations out of the critical path. To this end, it leverages the io_uring to perform asynchronous I/Os. Furthermore, regarding the potential I/O congestion caused by accelerated compactions, Pome incorporates an adaptive I/O rate limiter to achieve smooth execution. We prototype Pome on top of RocksDB. Experimental results demonstrate that Pome significantly improves the performance of RocksDB and outperforms several state-of-the-art LSM-tree variants.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑