Research on the Bottom Layer I/O Strategy of Net-RAID
Feng Dan
Abstract
Feng Dan
Abstract
This paper proposes an innovational solution that traces net users' requests and queues them according to their logical addresses based on the characteristics of Net-RAID. 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, reduces the average I/O response time,and improves system performance obviously.
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.
This paper proposes an innovational solution that traces net users' requests and queues them according to their logical addresses based on the characteristics of Net-RAID. 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, reduces the average I/O response time,and improves system performance obviously.
Key concepts: RAID, Computer science, Queue, Net (polyhedron), Layer (electronics), Operating system, Computer network, Parallel computing