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 条
  • [31] BUFFERED DISK I/O
    BLUM, R
    DR DOBBS JOURNAL, 1985, 10 (02): : 98 - &
  • [32] VMCD: A Virtual Multi-Channel Disk I/O Scheduling Method for Virtual Machines
    Tan, Huailiang
    Li, Chao
    He, Zaihong
    Li, Keqin
    Hwang, Kai
    IEEE TRANSACTIONS ON SERVICES COMPUTING, 2016, 9 (06) : 982 - 995
  • [33] Energy-aware disk scheduling for soft real-time I/O requests
    Youjip Won
    Jongmin Kim
    Wonmin Jung
    Multimedia Systems, 2008, 13 : 409 - 428
  • [34] Energy-aware disk scheduling for soft real-time I/O requests
    Won, Youjip
    Kim, Jongmin
    Jung, Wonmin
    MULTIMEDIA SYSTEMS, 2008, 13 (5-6) : 409 - 428
  • [35] Hierarchical I/O Scheduling for Collective I/O
    Liu, Jialin
    Chen, Yong
    Zhuang, Yu
    PROCEEDINGS OF THE 2013 13TH IEEE/ACM INTERNATIONAL SYMPOSIUM ON CLUSTER, CLOUD AND GRID COMPUTING (CCGRID 2013), 2013, : 211 - 218
  • [36] Lazy Scheduling Based Disk Energy Optimization Method
    Yong Dong
    Juan Chen
    Yuhua Tang
    Junjie Wu
    Huiquan Wang
    Enqiang Zhou
    TsinghuaScienceandTechnology, 2020, 25 (02) : 203 - 216
  • [37] Lazy Scheduling Based Disk Energy Optimization Method
    Dong, Yong
    Chen, Juan
    Tang, Yuhua
    Wu, Junjie
    Wang, Huiquan
    Zhou, Enqiang
    TSINGHUA SCIENCE AND TECHNOLOGY, 2020, 25 (02) : 203 - 216
  • [38] Efficient Asynchronous I/O with Request Merging
    Chowdhury, Md Kamal Hossain
    Tang, Houjun
    Bez, Jean Luca
    Bangalore, Purushotham V.
    Byna, Suren
    2023 IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS, IPDPSW, 2023, : 628 - 636
  • [39] Optimization of Scheduling Mode for Conflicts across the Block
    Bao, Lidan
    Xu, Si
    Zhang, Tiejun
    Wang, Donghui
    Hou, Chaohuan
    2013 INTERNATIONAL CONFERENCE ON INFORMATION SCIENCE AND TECHNOLOGY (ICIST), 2013, : 598 - 601
  • [40] An I/O Optimization Method Based on Balanced Scheduling for MapReduce Framework in HPC
    Sun, Litong
    Lu, Yutong
    Zhang, Wei
    2ND INTERNATIONAL CONFERENCE ON INFORMATION AND COMMUNICATION TECHNOLOGY FOR EDUCATION (ICTE 2015), 2015, : 270 - 274