DRAM Cache Management with Request Granularity for NAND-based SSDs

Haodong Lin, Zhibing Sha, Jun Li, Zhigang Cai, Balazs Gerofi, Yuanquan Shi, Jianwei Liao
{"title":"DRAM Cache Management with Request Granularity for NAND-based SSDs","authors":"Haodong Lin, Zhibing Sha, Jun Li, Zhigang Cai, Balazs Gerofi, Yuanquan Shi, Jianwei Liao","doi":"10.1145/3545008.3545081","DOIUrl":null,"url":null,"abstract":"Most flash-based solid-state drives (SSDs) employ an on-board Dynamic Random Access Memory (DRAM) to cache hot data at the SSD page granularity. This can significantly reduce the number of flush operations to the underlying arrays of SSDs given that there is sufficient locality in the applications’ I/O access pattern. We observe, however, that in most I/O workloads over SSDs the buffered data of small sized requests are more likely to be re-accessed than those of larger requests, which also require more DRAM space for caching their data. To improve the efficiency of the DRAM cache inside SSDs, this paper presents a request granularity-based cache management scheme, called Req-block. The proposed mechanism manages cached data according to the size of write requests and supports multi-level linked lists for sifting the cached data blocks (termed as request blocks), by taking both their size and hotness into account. Comprehensive evaluation shows that our proposal improves cache hits by up to 90.5%, and decreases I/O latency by 14.3% on average, compared to existing state-of-the-art SSD cache management schemes.","PeriodicalId":360504,"journal":{"name":"Proceedings of the 51st International Conference on Parallel Processing","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 51st International Conference on Parallel Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3545008.3545081","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Most flash-based solid-state drives (SSDs) employ an on-board Dynamic Random Access Memory (DRAM) to cache hot data at the SSD page granularity. This can significantly reduce the number of flush operations to the underlying arrays of SSDs given that there is sufficient locality in the applications’ I/O access pattern. We observe, however, that in most I/O workloads over SSDs the buffered data of small sized requests are more likely to be re-accessed than those of larger requests, which also require more DRAM space for caching their data. To improve the efficiency of the DRAM cache inside SSDs, this paper presents a request granularity-based cache management scheme, called Req-block. The proposed mechanism manages cached data according to the size of write requests and supports multi-level linked lists for sifting the cached data blocks (termed as request blocks), by taking both their size and hotness into account. Comprehensive evaluation shows that our proposal improves cache hits by up to 90.5%, and decreases I/O latency by 14.3% on average, compared to existing state-of-the-art SSD cache management schemes.
基于nand的ssd的请求粒度的DRAM缓存管理
大多数基于闪存的固态硬盘(SSD)使用板载动态随机存取内存(DRAM)以SSD页面粒度缓存热数据。如果应用程序的I/O访问模式中有足够的局部性,这可以显著减少对底层ssd阵列的刷新操作的数量。然而,我们观察到,在大多数使用ssd的I/O工作负载中,小型请求的缓冲数据比大型请求的缓冲数据更有可能被重新访问,而大型请求也需要更多的DRAM空间来缓存它们的数据。为了提高ssd内部DRAM缓存的效率,本文提出了一种基于请求粒度的缓存管理方案,称为Req-block。提议的机制根据写请求的大小管理缓存数据,并支持多级链表,通过考虑缓存数据块的大小和热度来筛选缓存数据块(称为请求块)。综合评估表明,与现有的最先进的SSD缓存管理方案相比,我们的建议将缓存命中率提高了90.5%,平均将I/O延迟降低了14.3%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信