The performance of a disk system is often measured in terms of the length of the waiting line or queue of requests for each of the system's spindles. Thus it is natural to formulate and analyze queueing models of disk systems. While most disk systems have certain characteristics, such as channel interference and concurrent seeks, in common, previous analyses have always been begun from scratch, without exploiting this commonality. We introduce a general queueing model for disk systems, which incorporates the characteristics common to most disk systems, and use it in the approximate analyses of models of the IBM 2314 and 3330 disk systems. Comparisons with simulation statistics show that the approximations made are very good over a wide range of arrival rates and system parameters. We also show how to use the analytic results to investigate performance differences between devices.
[1]
Harvey Dubner,et al.
Queueing Analysis of the IBM 2314 Disk Storage Facility
,
1968,
JACM.
[2]
J D Littler,et al.
A PROOF OF THE QUEUING FORMULA
,
1961
.
[3]
Michael A. Crane,et al.
Simulating Stable Stochastic Systems, I: General Multiserver Queues
,
1974,
JACM.
[4]
J. Little.
A Proof for the Queuing Formula: L = λW
,
1961
.
[5]
Charles E. Skinner,et al.
A Priority Queuing System with Server-Walking Time
,
1967,
Oper. Res..
[6]
Toby Jackson Teorey,et al.
The role of disk scheduling in multiprogrammed computer systems
,
1972
.
[7]
Calvin C. Gotlieb,et al.
Performance of Movable-Head Disk Storage Devices
,
1973,
JACM.
[8]
Lajos Takacs.
On a Stochastic Process Concerning Some Waiting Time Problems
,
1957
.