This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
11th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems (MASCOTS'03)
It?s not fair - evaluating efficient disk scheduling
Orlando, Florida
October 12-October 15
ISBN: 0-7695-2039-1
Alma Riska, Seagate Research
Erik Riedel, Seagate Research
Storage system designers prefer to limit the maximum queue length at individual disks to only a few outstanding requests, to avoid possible request starvation. In this paper, we evaluate the benefits and performance implications of allowing disks to queue more requests. We show that the average response time in the storage subsystem is reduced when queuing more requests and optimizing (based on seek and/or position time) request scheduling at the disk. We argue that the disk, as the only service center in a storage subsystem, is able to best utilize its resources via scheduling when it has the most complete view of the load it is about to process. The benefits of longer queues at the disks are even more obvious when the system operates under transient overload conditions.
Index Terms:
disk scheduling, unfair scheduling, response time distribution, request starvation
Citation:
Alma Riska, Erik Riedel, "It?s not fair - evaluating efficient disk scheduling," mascots, pp.288, 11th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems (MASCOTS'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.