Merging and Prioritizing Optimization in Block I/O Scheduling of Disk Storage

被引:4
|
作者
Li, Hui [1 ]
Liao, Jianwei [1 ]
Liu, Xiaoyan [2 ]
机构
[1] Southwest Univ, Coll Comp & Informat Sci, Chongqing 400715, Peoples R China
[2] Southwest Univ, Dept Educ Adm, Chongqing 400715, Peoples R China
关键词
Disk storage; block I/O scheduling; adaptive splitting; merging and prioritizing; average I/O response time;
D O I
10.1142/S0218126621501863
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
I/O merging optimization at the block I/O layer of disk storage is widely adopted to reduce I/O response time. But it may result in certain overhead of merging judgment in the case of a large number of concurrent I/O requests accessing disk storage, and place negative effects on the response of small requests. This paper proposes a divide and conquer scheduling scheme at the block layer of I/O stack, to satisfy a large number of concurrent I/O requests with less I/O response time and ensure the fairness of each request response by decreasing the average I/O latency. First, we propose a horizontal visibility graph-based approach to cluster relevant block requests, according to their offsets (i.e., logic block numbers). Next, it carries out the optimization operation of merging consecutive block I/O requests within each cluster, as only these requests in the same cluster are most likely to be issued by a specific application. Then, we have introduced the functionality of merging judgment when performing merging optimization to effectively guarantee the average I/O response time. After that, the merged requests in the queue will be reordered on the basis of their priorities, to purposely cut down the average I/O response time. Finally, the prioritized requests are supposed to be delivered to the disk storage, for being serviced. Through a series of experiments, we show that compared to the benchmark, the newly proposed scheme can not only cut down the I/O response time by more than 18.2%, but also decrease the average I/O response time up to 71.7%.
引用
收藏
页数:27
相关论文
共 50 条
  • [1] Adaptive Splitting-based Block I/O Scheduling in Disk Storage
    Li, Hui
    Chen, Shanxiong
    Xiao, Guoqiang
    Peng, Xiaoning
    Liao, Jianwei
    2018 IEEE 42ND ANNUAL COMPUTER SOFTWARE AND APPLICATIONS CONFERENCE (COMPSAC), VOL 1, 2018, : 668 - 676
  • [2] A novel disk I/O scheduling framework of virtualized storage system
    Li, Dingding
    Dong, Mianxiong
    Tang, Yong
    Ota, Kaoru
    CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2019, 22 (Suppl 1): : 2395 - 2405
  • [3] A novel disk I/O scheduling framework of virtualized storage system
    Dingding Li
    Mianxiong Dong
    Yong Tang
    Kaoru Ota
    Cluster Computing, 2019, 22 : 2395 - 2405
  • [4] Block I/O Scheduling on Storage Servers of Distributed File Systems
    Jianwei Liao
    Dong Yin
    Xiaoning Peng
    Journal of Grid Computing, 2018, 16 : 299 - 316
  • [5] Block I/O Scheduling on Storage Servers of Distributed File Systems
    Liao, Jianwei
    Yin, Dong
    Peng, Xiaoning
    JOURNAL OF GRID COMPUTING, 2018, 16 (02) : 299 - 316
  • [6] Disk Scheduling in a Multimedia I/O System
    Reddy, A. L. N.
    Wyllie, Jim
    Wijayaratne, K. B. R.
    ACM TRANSACTIONS ON MULTIMEDIA COMPUTING COMMUNICATIONS AND APPLICATIONS, 2005, 1 (01) : 37 - 59
  • [7] Disk-Cache and Parallelism Aware I/O Scheduling to Improve Storage System Performance
    Prabhakar, Ramya
    Kandemir, Mahmut
    Jung, Myoungsoo
    IEEE 27TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS 2013), 2013, : 357 - 368
  • [8] Real-time disk scheduling for block-stripping I2O RAID
    Kuo, TW
    Rao, JS
    Lee, VCS
    Wu, J
    13TH EUROMICRO CONFERENCE ON REAL-TIME SYSTEMS, PROCEEDINGS, 2001, : 217 - 224
  • [9] Robust, portable I/O scheduling with the disk mimic
    Popovici, FI
    Arpaci-Dusseau, AC
    Arpaci-Dusseau, RH
    USENIX ASSOCIATION PROCEEDINGS OF THE GENERAL TRACK, 2003, : 297 - 310
  • [10] Research on I/O resource scheduling algorithms for utility optimization towards cloud storage
    Wang, Jianzong
    Chen, Yanjun
    Xie, Changsheng
    Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2013, 50 (08): : 1657 - 1666