一种面向重尾分布的SSD磁盘调度算法

J4 ›› 2015, Vol. 37 ›› Issue (06): 1043-1046.

一种面向重尾分布的SSD磁盘调度算法

魏元豪1，吴小华2，吴庆波1，邵立松1

(1.国防科学技术大学计算机学院,湖南长沙 410073;2.二炮装备研究院四所，北京 100085)

收稿日期:2014-03-28 修回日期:2014-05-14 出版日期:2015-06-25 发布日期:2015-06-25

An I/O scheduling algorithm of SSD based on heavy-tailed distributions

WEI Yuanhao1,WU Xiaohua2,WU Qingbo1,SHAO Lisong1

(1.College of Computer,National University of Defense Technology,Changsha 410073;
2.The Fourth Research Institute of the Second Artillery Equipment Academy,Beijing 100085,China)

Received:2014-03-28 Revised:2014-05-14 Online:2015-06-25 Published:2015-06-25

摘要/Abstract

摘要：

存储设备上的大量文件其长度呈重尾态分布，IO请求的响应延迟和请求大小有着密切关系，并且固态硬盘的IO操作不对称。基于以上几点，在内核NOOP调度算法的基础上提出一种针对重尾数据分布下的IO调度算法。该算法通过减少大量小片请求的等待时间，提高固态硬盘的性能。经实验验证，相比内核的NOOP调度算法，平均响应时间减少17%。

关键词: IO调度, 固态硬盘, 重尾分布

Abstract:

The size of the files stored in the network server has heavy-tailed feature. Access latency is dependent on the size of the accessed files, and the IO operations of Solid State Disk (SSD) are asymmetric. Therefore, based on the kernel NOOP scheduling algorithm, we propose an I/O scheduling algorithm of SSD based on the heavy-tailed distributions to improve the performance of SSD access by reducing the waiting time for lots of small files. Experimental results show that the proposed algorithm can reduce response time by 17% on average compared with the kernel NOOP scheduling algorithm.

Key words: IO scheduler;SSD;heavy-tailed distributions

魏元豪1，吴小华2，吴庆波1，邵立松1. 一种面向重尾分布的SSD磁盘调度算法[J]. J4, 2015, 37(06): 1043-1046.

WEI Yuanhao1,WU Xiaohua2,WU Qingbo1,SHAO Lisong1. An I/O scheduling algorithm of SSD based on heavy-tailed distributions [J]. J4, 2015, 37(06): 1043-1046.

[1]	俞丁翠, 罗龙飞, 宋云鹏, 李文通, 石亮. 面向高密度闪存的内存页大小探索[J]. 计算机工程与科学, 2024, 46(07): 1167-1174.
[2]	梅飞，曹强. SSDKV：一种SSD友好的键值对存储系统[J]. J4, 2016, 38(07): 1299-1308.
[3]	陈博, 肖侬, 刘芳, 欧洋, 何晚辉. 一种面向RAID阵列的SSD设计优化方法[J]. 计算机工程与科学, 2014, 36(07): 1226-1230.