loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2006 International Workshop on Networking, Architecture, and Storages (IWNAS'06)
An Analytical Model for Scheduling Policies in Storage Networks
Shenyang, China
August 01-August 03
ISBN: 0-7695-2651-9
Diqing Hu, Huazhong University of Science and Technology, Wuhan, Hubei, P.R.China
Qiang Cao, Huazhong University of Science and Technology, Wuhan, Hubei, P.R.China
Changsheng Xie, Huazhong University of Science and Technology, Wuhan, Hubei, P.R.China
The I/O routine in network storage has longer transferring time and overhead than local I/O. To well make use of the storage network bandwidth and meet demand of concurrent I/O requests, we need to find the appropriate schedule policy for I/O requests at the level of the network. The focus in the paper is on how to schedule concurrent I/O data transferring in share storage network, and to improve performance such as the response time affected by scheduling method. Our objective is to analysis the response time of concurrent requests as function their schedule order such as the sequenced, parallel and hybrid policies. We then verify our results by both the analytical method and experiment.
Citation:
Diqing Hu, Qiang Cao, Changsheng Xie, "An Analytical Model for Scheduling Policies in Storage Networks," iwnas, pp.157-161, 2006 International Workshop on Networking, Architecture, and Storages (IWNAS'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.