Summary of minimal-total-processing-time drum and disk scheduling disciplines

  • Authors:

  • Samuel H. Fuller

  • Affiliations:

  • Depts. of Computer Science and Electrical Engineering, Carnegie-Mellon University, Pittsburgh, Pennsylvania

  • Venue:
  • SOSP '73 Proceedings of the fourth ACM symposium on Operating system principles
  • Year:
  • 1973

Quantified Score

Hi-index 0.00

Visualization

Abstract

This article investigates the application of minimal-total-processing-time (MTPT) scheduling disciplines to rotating storage units when random arrival of requests is allowed. Fixed-head drum and moving-head disk storage units are considered and particular emphasis is placed on the relative merits of the MTPT scheduling discipline with respect to the shortest-latency-time-first (SLTF) scheduling discipline. The results of the simulation studies presented show that neither scheduling discipline is unconditionally superior to the other. For most fixed-head drum applications the SLTF discipline is preferable to MTPT, but for intra-cylinder disk scheduling the MTPT discipline offers a distinct advantage over the SLTF discipline. An implementation of the MTPT scheduling discipline is discussed and the computational requirements of the algorithm are shown to be comparable to SLTF algorithms. In both cases, the sorting procedure is the most time consuming phase of the algorithm.