Numerical Inversion of Laplace Transforms by Relating Them to the Finite Fourier Cosine Transform
Journal of the ACM (JACM)
Performance of Movable-Head Disk Storage Devices
Journal of the ACM (JACM)
Queueing Analysis of the Scan Policy for Moving-Head Disks
Journal of the ACM (JACM)
A General Model for the Performance of Disk Systems
Journal of the ACM (JACM)
Optimal space allocation on disk storage devices
Communications of the ACM
Minimal-total-processing time drum and disk scheduling disciplines
Communications of the ACM
Curriculum recommendations for graduate professional programs in information systems
Communications of the ACM
On the optimization of performance of time-sharing systems by simulation
Communications of the ACM
Communications of the ACM
The role of computer system models in performance evaluation
Communications of the ACM
A queuing model of a multiprogrammed computer with a two-level storage system
Communications of the ACM
Curriculum recommendations for undergraduate programs in information systems
Communications of the ACM
ACM '72 Proceedings of the ACM annual conference - Volume 2
Simulation of a computer system with single and dual density discs
ANSS '73 Proceedings of the 1st symposium on Simulation of computer systems
Summary of minimal-total-processing-time drum and disk scheduling disciplines
SOSP '73 Proceedings of the fourth ACM symposium on Operating system principles
Studies in Markov models of computer systems
ACM '75 Proceedings of the 1975 annual conference
A virtual server queueing network method for component based performance modelling of metacomputing
Future Generation Computer Systems - Special issue: Semantic grid and knowledge grid: the next-generation web
Performance prediction of a virtual machine
ACM SIGMETRICS Performance Evaluation Review
Performance of a virtual memory: some experimental results
ACM SIGMETRICS Performance Evaluation Review
Estimating response time for auxiliary memory configurations with multiple movable-head disk modules
VLDB '75 Proceedings of the 1st International Conference on Very Large Data Bases
Optimizing the Performance of a Drum-Like Storage
IEEE Transactions on Computers
TICKETRON: a successfully operating system without an operating system
AFIPS '70 (Spring) Proceedings of the May 5-7, 1970, spring joint computer conference
Analysis of retrieval performance for selected file organization techniques
AFIPS '70 (Fall) Proceedings of the November 17-19, 1970, fall joint computer conference
Performance evaluation: a structured approach
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Properties of disk scheduling policies in multiprogrammed computer systems
AFIPS '72 (Fall, part I) Proceedings of the December 5-7, 1972, fall joint computer conference, part I
A methodology for multi-criteria information system design
AFIPS '77 Proceedings of the June 13-16, 1977, national computer conference
Performance determination: the selection of tools, if any
AFIPS '73 Proceedings of the June 4-8, 1973, national computer conference and exposition
Finite queueing approximation techniques for analysis of computer systems
AFIPS '81 Proceedings of the May 4-7, 1981, national computer conference
The evolution of magnetic storage
IBM Journal of Research and Development
| Hi-index | 0.13 |
In this paper the use of the techniques of queueing theory in analyzing the performance of a mass storage device in a real-time environment is demonstrated; concern is with the tradeoff experienced in practice between throughput of a stochastic service device and the response time for each service request. For concreteness, the analysis is applied to the IBM 2314 disk storage facility. The results are presented in a series of graphs showing the file system response time versus the throughput for several distributions of record length and arm movement. The queueing model and the theoretical tools used are described in sufficient detail to permit the reader to apply the techniques to other systems. In particular, any disk whose seek time characteristic can be approximated by a piecewise linear continuous function may be analyzed by the methods presented.