Cart (Loading....) | Create Account
Close category search window
 

Implementation and Evaluation of a Dynamic Schedule Policy for Multi-user Request in Network-Attached Disk Array

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jieqiong Li ; Comput. Dept., Huazhong Univ. of Sci. & Technol., Wuhan ; Dan Feng

In the storage system, the bottom layer I/O schedule strategy is very important which decides the efficiency of the system. A good schedule policy can improve system performance obviously. This paper proposes an innovational solution that traces net userspsila requests and queues them according to their logical addresses based on the characteristics of network attached disk array. Theoretical analysis and test results show that the policy makes the access arm of the disks move regularly, decreases the diskpsilas I/O time maximally, and reduces the average I/O response time of the system.

Published in:

Young Computer Scientists, 2008. ICYCS 2008. The 9th International Conference for

Date of Conference:

18-21 Nov. 2008

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.