Guidelines for the use of infinite source queueing models in the analysis of computer system performance

Authors:
J. P. Buzen;P. S. Goldberg
Affiliations:
Harvard University, Cambridge, Massachusetts and Honeywell Information Systems, Waltham, Massachusetts;Case Western Reserve University, Cleveland, Ohio
Venue:
AFIPS '74 Proceedings of the May 6-10, 1974, national computer conference and exposition
Year:
1974

Citing 1
Cited 1

A Survey of Analytical Time-Sharing Models

ACM Computing Surveys (CSUR)

Finite queueing approximation techniques for analysis of computer systems

AFIPS '81 Proceedings of the May 4-7, 1981, national computer conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

Mathematical models based on queueing theory are widely used in the analysis of computer system performance. As in the case of other engineering disciplines, these models never correspond exactly to the real systems they are intended to represent. However, if the associated error terms are sufficiently small the models can still serve as valuable tools for estimating performance levels in specific cases and for studying the factors which influence overall system behavior. In this paper we examine some error terms which arise when the familiar M/G/1 queueing model is used to predict expected response times and queue lengths in systems which contain only a finite number of sources.