This Article 
 Bibliographic References 
 Add to: 
An Optimal Drum Scheduling Algorithm
November 1972 (vol. 21 no. 11)
pp. 1153-1165
S.H. Fuller, Departments of Computer Science and Electrical Engineering, Carnegie-Mellon University
Suppose a set of N records must be read or written from a drum, fixed-head disk, or similar storage unit of a computer system. The records vary in length and are arbitrarily located on the surface of the drum. The problem considered here is to find an algorithm that schedules the processing of these records with the minimal total amount of rotational latency (access time), taking into account the current position of the drum. This problem is a special case of the traveling salesman problem. The algorithm that is developed has the attractive property of exhibiting a computational complexity on the order of N log N.
Index Terms:
Disk scheduling, drum scheduling, file scheduling, graph theory, rotational latency analysis, theory of scheduling, traveling salesman problem.
S.H. Fuller, "An Optimal Drum Scheduling Algorithm," IEEE Transactions on Computers, vol. 21, no. 11, pp. 1153-1165, Nov. 1972, doi:10.1109/T-C.1972.223472
Usage of this product signifies your acceptance of the Terms of Use.