The study on schedule policy of data transferring in storage network. (3rd January 2011)

• Record Type: Journal Article
• Authors: Hu, Diqing; Cao, Qiang; Xie, ChangSheng
• Is Part Of: International journal of high performance computing and networking. Volume 6:Number 3/4(2010)
• Page Start: 208
• Page End: 212
• Publication Date: 2011-01-03
• Subjects: storage networks -- input&amp -- #47 -- output -- I&amp -- #47 -- O -- schedule policy -- concurrent requests -- data transfer -- scheduling; High performance computing -- Periodicals; Computer networks -- Periodicals; High performance computing; Periodicals; 004.05
• Languages: English
• ISSNs: 1740-0562

Abstract

The I/O routine in network storage has longer transferring time and overhead than local I/O. To make good 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 analyse the response time of concurrent requests as function of their schedule order such as the sequenced, parallel and hybrid policies. We then verify our results by both the analytical and experimental method.