Queue-based Dynamic Schedule Algorithm for Multi-user Request in Network-attached Disk Array
Fneg Dan
Abstract
Fneg Dan
Abstract
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 could improve system performance obviously.This paper proposed an innovational solution that traces net users' 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 disk's I/O time maximally,and reduces the average I/O response time of the system.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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 could improve system performance obviously.This paper proposed an innovational solution that traces net users' 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 disk's I/O time maximally,and reduces the average I/O response time of the system.
Key concepts: Computer science, Schedule, Queue, Disk array, Algorithm, Distributed computing, Real-time computing, Computer network