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

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.