Abstract
The queueing theory of exponential servers as applied to time sharing computer systems is discussed in detail with respect to response time and throughput. The restriction that only a fixed number of transactions may be processed simultaneously by the computer subsystem is treated, with comparison made among four different approximations.

This publication has 0 references indexed in Scilit: