Extremely-Compressed SSDs with I/O Behavior Prediction

Author:

Yao Xiangyu1ORCID,Li Qiao1ORCID,Lin Kaihuan1ORCID,Gan Xinbiao2ORCID,Zhang Jie3ORCID,Gao Congming1ORCID,Shen Zhirong1ORCID,Xu Quanqing4ORCID,Yang Chuanhui4ORCID,Xue Jason5ORCID

Affiliation:

1. School of Informatics, Xiamen University, Xiamen, China

2. National University of Defense Technology, Changsha, China

3. The School of Computer Science, Peking University, Beijing, China

4. OceanBase, Ant Group, Hangzhou, China

5. Mohamed bin Zayed University of Artificial Intelligence, Masdar City, United Arab Emirates

Abstract

As the data volume continues to grow exponentially, there is an increasing demand for large storage system capacity. Data compression techniques effectively reduce the volume of written data, enhancing space efficiency. As a result, many modern SSDs have already incorporated data compression capabilities. However, data compression introduces additional processing overhead in critical I/O paths, potentially affecting system performance. Currently, most compression solutions in flash-based storage systems employ fixed compression algorithms for all incoming data without leveraging differences among various data access patterns. This leads to sub-optimal compression efficiency. This article proposes a data-type-aware Flash Translation Layer (DAFTL) scheme to maximize space efficiency without compromising system performance. First, we propose an I/O behavior prediction method to forecast future access on specific data. Then, DAFTL matches data types with distinct I/O behaviors to compression algorithms of varying intensities, achieving an optimal balance between performance and space efficiency. Specifically, it employs higher-intensity compression algorithms for less frequently accessed data to maximize space efficiency. For frequently accessed data, it utilizes lower-intensity but faster compression algorithms to maintain system performance. Finally, an improved compact compression method is proposed to effectively eliminate page fragmentation and further enhance space efficiency. Extensive evaluations using a variety of real-world workloads, as well as the workloads with real data we collected on our platforms, demonstrate that DAFTL achieves more data reductions than other approaches. When compared to the state-of-the-art compression schemes, DAFTL reduces the total number of pages written to the SSD by an average of 8%, 21.3%, and 25.6% for data with high, medium, and low compressibility, respectively. In the case of workloads with real data, DAFTL achieves an average reduction of 10.4% in the total number of pages written to SSD. Furthermore, DAFTL exhibits comparable or even improved read and write performance compared to other solutions.

Funder

National Key R&D Program of China

Natural Science Foundation of Xiamen

National Natural Science Foundation of China

China Fundamental Research Funds

Central Universities

Ant Group through CCF-Ant Research Fund

Publisher

Association for Computing Machinery (ACM)

Reference64 articles.

1. Przemyslaw Skibinski Jinfei Han Dmitry Atamanov Andrea Bocci and Chip Turner. 2015. Lzbench. Retrieved 30 June 2024 from https://github.com/inikep/lzbench

2. Milosz Krajewski. 2015. Silesia Compression Corpus. Retrieved 30 June 2024 from https://github.com/MiloszKrajewski/SilesiaCorpus

3. Facebook. 2016. ZSTD. Retrieved 30 June 2024 from https://github.com/facebook/zstd

4. Chao Shi and Qiuping Wang. 2018. Alibaba Block Traces. Retrieved 30 June 2024 from https://github.com/alibaba/block-traces

5. Ohad Rodeh Josef Bacik and Chris Mason. 2013. BTRFS: The linux B-tree filesystem. ACM Transactions on Storage (TOS) 9 3 (2013) 1–32.

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3