Study of Multiprogrammed Computer Systems with Memory Hierarchies.
Abstract
The possibility of using queueing networks to study the performance of multiprogrammed computer systems that use memory hierarchies was investigated. It was found that these kinds of models are adequate provided the success function of the memory hierarchy is known. A stochastic algorithm to obtain the success function of the hierarchy was developed. The results obtained, whenever this model is used in conjunction with the queueing network, were extensively compared with conventional simulation techniques, and the accuracy found to be within five percent. The problem of scheduling the Central Processor was considered, and empirical algorithms to determine policies that set upper and lower bounds on the success function of the hierarchy were proposed. Mathematical methods were employed to analyze various system configurations, that include several input-output channels and processors. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Jul 15, 1972
- Accession Number
- AD0756476
Entities
People
- C. V. Ramamoorthy
- Rodrigo Querubin
Organizations
- University of Texas at Austin