Pinpointing and scheduling access conflicts to improve internal resource utilization in solid-state drives

被引:5
作者
Xie, Xuchao [1 ]
Xiao, Liquan [1 ]
Wei, Dengping [1 ]
Li, Qiong [1 ]
Song, Zhenlong [1 ]
Ge, Xiongzi [2 ]
机构
[1] Natl Univ Def Technol, Coll Comp, Changsha 410073, Hunan, Peoples R China
[2] Univ Minnesota, Dept Comp Sci, Minneapolis, MN 55455 USA
关键词
solid-state drive; access conflict; I; O scheduler; internal resource utilization; PIOS; FLASH MEMORY; SYSTEM; PARALLELISM;
D O I
10.1007/s11704-018-7113-1
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Modern solid-state drives (SSDs) are integrating more internal resources to achieve higher capacity. Parallelizing accesses across internal resources can potentially enhance the performance of SSDs. However, exploiting parallelism inside SSDs is challenging owing to real-time access conflicts. In this paper, we propose a highly parallelizable I/O scheduler (PIOS) to improve internal resource utilization in SSDs from the perspective of I/O scheduling. Specifically, we first pinpoint the conflicting flash requests with precision during the address translation in the Flash Translation Layer (FTL). Then, we introduce conflict eliminated requests (CERs) to reorganize the I/O requests in the device-level queue by dispatching conflicting flash requests to different CERs. Owing to the significant performance discrepancy between flash read and write operations, PIOS employs differentiated scheduling schemes for read and write CER queues to always allocate internal resources to the conflicting CERs that are more valuable. The small dominant size prioritized scheduling policy for the write queue significantly decreases the average write latency. The high parallelism density prioritized scheduling policy for the read queue better utilizes resources by exploiting internal parallelism aggressively. Our evaluation results show that the parallelizable I/O scheduler (PIOS) can accomplish better SSD performance than existing I/O schedulers implemented in both SSD devices and operating systems.
引用
收藏
页码:35 / 50
页数:16
相关论文
共 31 条
[1]  
Agrawal N., 2008, USENIX 2008 ANN TECH
[2]  
[Anonymous], 2016, P 8 USENIX WORKSH HO
[3]  
[Anonymous], 2011, ACM 11 P INT C SUPER
[4]   Gordon: Using Flash Memory to Build Fast, Power-efficient Clusters for Data-intensive Applications [J].
Caulfield, Adrian M. ;
Grupp, Laura M. ;
Swanson, Steven .
ACM SIGPLAN NOTICES, 2009, 44 (03) :217-228
[5]  
Chen F, 2011, INT S HIGH PERF COMP, P266, DOI 10.1109/HPCA.2011.5749735
[6]  
Chen F, 2009, PERF E R SI, V37, P181
[7]  
Chen Feng, 2011, P INT C SUP, P22
[8]  
Gao C., 2014, 2014 30 S MASS STOR, P1
[9]   Parallelism and Garbage Collection aware I/O Scheduler with Improved SSD Performance [J].
Guo, Jiayang ;
Hu, Yiming ;
Mao, Bo ;
Wu, Suzhen .
2017 31ST IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS), 2017, :1184-1193
[10]   DFTL: A Flash Translation Layer Employing Demand-based Selective Caching of Page-level Address Mappings [J].
Gupta, Aayush ;
Kim, Youngjae ;
Urgaonkar, Bhuvan .
ACM SIGPLAN NOTICES, 2009, 44 (03) :229-240