Summary: New Algorithms for the Disk Scheduling Problem
Matthew Andrews \Lambda
Laboratory for Computer Science
MIT
andrews@theory.lcs.mit.edu
Michael A. Bender y
Aiken Computation Laboratory
Harvard University
bender@das.harvard.edu
Lisa Zhang z
Laboratory for Computer Science
MIT
ylz@theory.lcs.mit.edu
Abstract
Processor speed and memory capacity are increasing sev­
eral times faster than disk speed. This disparity suggests that
disk I/O performance will become an important bottleneck.
Methods are needed for using disks more efficiently. Past
analysis of disk scheduling algorithms has largely been exper­
imental and little attempt has been made to develop algorithms

Source: Andrews, Matthew - Mathematics of Networks and Systems, Mathematical Sciences Research Center, Bell Laboratories
Bender, Michael - Department of Computer Science, SUNY at Stony Brook

Collections: Computer Technologies and Information Sciences; Mathematics