Finite queueing approximation techniques for analysis of computer systems

Authors:
Dimitris A. Protopapas
Affiliations:
ITT/Advanced Technology Center, Shelton, Connecticut
Venue:
AFIPS '81 Proceedings of the May 4-7, 1981, national computer conference
Year:
1981

Citing 9
Cited 0

Fundamentals of queueing theory (2nd ed.).

Fundamentals of queueing theory (2nd ed.).
Introduction to operations research, 4th ed.

Introduction to operations research, 4th ed.
Queueing Analysis of the IBM 2314 Disk Storage Facility

Journal of the ACM (JACM)
An Analysis of Drum Storage Units

Journal of the ACM (JACM)
A General Model for the Performance of Disk Systems

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

Communications of the ACM
Probability, Statistics, and Queueing Theory with Computer Science Applications

Probability, Statistics, and Queueing Theory with Computer Science Applications
Optimizing the Performance of a Drum-Like Storage

IEEE Transactions on Computers
Guidelines for the use of infinite source queueing models in the analysis of computer system performance

AFIPS '74 Proceedings of the May 6-10, 1974, national computer conference and exposition

Quantified Score

Hi-index	0.01

Visualization

Abstract

Computer systems with finite request sourcing have been analyzed in the past using infinite source queues or an M/M/1/N queue, both of which may lead to large errors. This paper develops approximations to the response times of the M/G/1/N and GI/G/1/N queues, allowing application of these more realistic models in performance analyses of computer systems.