Minimal-total-processing time drum and disk scheduling disciplines

Authors:
Samuel H. Fuller
Affiliations:
Carnegie-Mellon Univ., Pittsburg, PA
Venue:
Communications of the ACM
Year:
1974

Citing 8
Cited 3

Queueing Analysis of the IBM 2314 Disk Storage Facility

Journal of the ACM (JACM)
Analysis of a Drum Input/Output Queue Under Scheduled Operation in a Paged Computer System

Journal of the ACM (JACM)
Analysis and Optimization of Disk Storage Devices for Time-Sharing Systems

Journal of the ACM (JACM)
A comparative analysis of disk scheduling policies

Communications of the ACM
On the near-optimality of the shortest-latency-time-first drum scheduling discipline

Communications of the ACM
The expected difference between the SLTF and MTPT drum scheduling disciplines (digest edition).

The expected difference between the SLTF and MTPT drum scheduling disciplines (digest edition).
Random arrivals and MTPT disk scheduling disciplines.

Random arrivals and MTPT disk scheduling disciplines.
An analysis of drum storage units.

An analysis of drum storage units.

An anomaly in disk scheduling: a comparison of FCFS and SSTF seek scheduling using an empirical model for disk accesses

Communications of the ACM
A practical queue-ordering algorithm to improve throughput of a server with sequence dependent make-ready delay

ANSS '75 Proceedings of the 3rd symposium on Simulation of computer systems
The scheduling of multiple disk drives

ACM '74 Proceedings of the 1974 annual conference - Volume 1

Quantified Score

Hi-index	48.24

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 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. The computational requirements of an algorithm that implements the MTPT scheduling discipline are shown to be comparable to SLTF algorithms. In both cases, the sorting procedure is the most time-consuming phase of the algorithm.