On the Near-Complete-Decomposability of Networks of Queues and of Stochastic Models of Multiprogramming Computing Systems
Scientific Interim rept.
CARNEGIE-MELLON UNIV PITTSBURGH PA DEPT OF COMPUTER SCIENCE
Pagination or Media Count:
Sufficient conditions under which a closed network of interconnected queues is nearly completely decomposable Si61, An63, are defined in terms of the resource service rates and the probabilities of transfer between queues. It is shown that when such conditions hold, the network may be organized as a hierarchy of aggregate resources, the equilibrium equations of which may be obtained separately as those of a finite single server queueing system. The interest of this approach in the analysis of multiqueue systems is discussed. This approach is used to define and evaluate performance criteria for multiprogramming storage hierarchies which are shown to be nearly completely decomposable systems. Finally, the use of an aggregative model is illustrated by the queueing analysis of a given paging time-sharing computing system.
- Operations Research
- Computer Programming and Software
- Computer Hardware
- Computer Systems