Queueing Models for Computer Systems.
Abstract
Results are obtained for two queueing models of computer systems. A multiprogramming model for a computer system with one I/O (input-output) facility, one C.P.U. (central processing unit), and an external queue is analyzed. Arrivals are Poisson and service distributions at both the I/O and the C.P.U. are exponential. With probability P, independent of past history, the termination of C.P.U. service of a job is due to I/O requirement. This permits a job to alternately require I/O and C.P.U. services several times. An expression for the mean number of jobs in the system is found, which is a function of a few state probabilities. A lower bound for the mean is obtained, and a possible upper bound is suggested. Several approximation models are investigated and compared.
Document Details
- Document Type
- Technical Report
- Publication Date
- Sep 01, 1974
- Accession Number
- ADA001125
Entities
People
- Pichit Nithivasin
Organizations
- University of California, Berkeley