.png){kind=icon}
返回
Delay-based I/O request scheduling in SSDs
.png){kind=icon}
PRE
AI
DOI：10.1016/j.sysarc.2019.05.001.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
To pave the way for fast data access, multiple parallel components (e.g., multiple dies) in SSDs are crafted. Therefore, how to fully utilize the parallel resources has become a challenging issue. To address this issue, we first design an SSD model, which not only considers the structure of the parallel components in SSDs but also investigates the utilization of these components. Then, a novel delay-based request scheduling strategy is devised based on the proposed model. The proposed scheduling strategy can predict the resource utilization and intelligently allocate requests to the parallel components (i.e., channels) to achieve the low storage access latency. We integrate the delay-based request scheduling with the proposed SSD model into a trace-driven simulator and evaluate the effectiveness of the proposed scheme on the Financial and WebSearch data sets. The experimental results show that the IOPS and request latency are improved by 16.5% and 14.2% respectively compared with the state-of-the-art scheduling strategy.
Keyword:
Request scheduling
NAND flash memory
Performance prediction
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.1
论文数:
3.0K
被引数:
4.2K
机构
引用论文
Exploring Parallel Data Access Methods in Emerging Non-Volatile Memory Systems探索新兴非易失性存储器系统中的并行数据存取方法
.png){kind=icon}
PREAI
分享收藏分享收藏
An energy-efficient encryption mechanism for NVM-based main memory in mobile systems移动系统中基于NVM的主存储器的节能加密机制
PREAI
分享收藏
查看更多内容