Analysis of system bottlenecks using a queueing network model

ABSTRACT

While it is well known that queues can build up at various points in large scale multiprogramming computer systems, comparatively little is known about the factors which govern the lengths of these queues and their relationship to overall system performance. The first part of this paper is concerned with developing a queueing network model which can be used to study a number of such questions. The model is then applied to a specific problem concerning the proportion of processing requests which should be directed to each of a set of functionally equivalent peripheral processors (e.g., disks and drums) in order to optimize overall system performance. A surprising result is that optimal performance is not attained when queue lengths and processor utilization percentages are equal, but rather when the fastest processor has the longest expected queue and is in effect creating a system bottleneck.

REFERENCES

• 1: Buzen, J. Queueing Network Models of Multiprogramming. Ph.D. Dissertation, Division of Engineering and Applied Physics, Harvard University, Cambridge, Mass. Available June 1971.
• 2: Gordon, W.J. and Newell, G.F. Closed queueing systems with exponential servers. Operations Research, 15, 2 (April 1967), 254-265.
• 3: Jackson, J.R. Jobshop-like queueing systems. Management Science, 10, 1 (October 1963), 131-142.

INDEX TERMS

Primary Classification:
  D. Software
  D.4 OPERATING SYSTEMS
      D.4.8 Performance
          Subjects: Queueing theory

Additional Classification:
  B. Hardware
  B.4 INPUT/OUTPUT AND DATA COMMUNICATIONS
      B.4.2 Input/Output Devices
          Subjects: Data terminals and printers

General Terms:
Measurement, Performance