Please wait a minute...
Front. Inform. Technol. Electron. Eng.  2012, Vol. 13 Issue (11): 799-815    DOI: 10.1631/jzus.C1200085
    
Strip-oriented asynchronous prefetching for parallel disk systems
Yang Liu, Jian-zhong Huang, Xiao-dong Shi, Qiang Cao, Chang-sheng Xie
Wuhan National Laboratory for Optoelectronics, Huazhong University of Science and Technology, Wuhan 430074, China; School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074, China
Strip-oriented asynchronous prefetching for parallel disk systems
Yang Liu, Jian-zhong Huang, Xiao-dong Shi, Qiang Cao, Chang-sheng Xie
Wuhan National Laboratory for Optoelectronics, Huazhong University of Science and Technology, Wuhan 430074, China; School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074, China
 全文: PDF 
摘要: Sequential prefetching schemes are widely employed in storage servers to mask disk latency and improve system throughput. However, existing schemes cannot benefit parallel disk systems as expected due to the fact that they ignore the distinct internal characteristics of the parallel disk system, in particular, data striping. Moreover, their aggressive prefetching pattern suffers from premature evictions and prolonged request latencies. In this paper, we propose a strip-oriented asynchronous prefetching (SoAP) technique, which is dedicated to the parallel disk system. It settles the above-mentioned problems by providing multiple novel features, e.g., enhanced prediction accuracy, adaptive prefetching strength, physical data layout awareness, and timely prefetching. To validate SoAP, we implement a prototype by modifying the software redundant arrays of inexpensive disks (RAID) under Linux. Experimental results demonstrate that SoAP can consistently offer improved average response time and throughput to the parallel disk system under non-random workloads compared with STEP, SP, ASP, and Linux-like SEQPs.
关键词: Parallel disk systemStripSequential prefetchingAsynchronous scheduling    
Abstract: Sequential prefetching schemes are widely employed in storage servers to mask disk latency and improve system throughput. However, existing schemes cannot benefit parallel disk systems as expected due to the fact that they ignore the distinct internal characteristics of the parallel disk system, in particular, data striping. Moreover, their aggressive prefetching pattern suffers from premature evictions and prolonged request latencies. In this paper, we propose a strip-oriented asynchronous prefetching (SoAP) technique, which is dedicated to the parallel disk system. It settles the above-mentioned problems by providing multiple novel features, e.g., enhanced prediction accuracy, adaptive prefetching strength, physical data layout awareness, and timely prefetching. To validate SoAP, we implement a prototype by modifying the software redundant arrays of inexpensive disks (RAID) under Linux. Experimental results demonstrate that SoAP can consistently offer improved average response time and throughput to the parallel disk system under non-random workloads compared with STEP, SP, ASP, and Linux-like SEQPs.
Key words: Parallel disk system    Strip    Sequential prefetching    Asynchronous scheduling
收稿日期: 2012-03-29 出版日期: 2012-11-02
CLC:  TP333  
服务  
把本文推荐给朋友
加入引用管理器
E-mail Alert
RSS
作者相关文章  
Yang Liu
Jian-zhong Huang
Xiao-dong Shi
Qiang Cao
Chang-sheng Xie

引用本文:

Yang Liu, Jian-zhong Huang, Xiao-dong Shi, Qiang Cao, Chang-sheng Xie. Strip-oriented asynchronous prefetching for parallel disk systems. Front. Inform. Technol. Electron. Eng., 2012, 13(11): 799-815.

链接本文:

http://www.zjujournals.com/xueshu/fitee/CN/10.1631/jzus.C1200085        http://www.zjujournals.com/xueshu/fitee/CN/Y2012/V13/I11/799

[1] Yuan-di Zhao, Jun-jie Cao, Zhi-xun Su, Zhi-yang Li. Efficient reconstruction of non-simple curves[J]. Front. Inform. Technol. Electron. Eng., 2011, 12(7): 523-532.