Issue No. 07 - July (1980 vol. 29)

ISSN: 0018-9340

pp: 611-618

S.T. Chanson , Department of Computer Science, University of British Columbia

ABSTRACT

This paper presents, using queuing theory and optimization techniques, an approach for estimating the optimal capacities and speeds of the memory levels in a memory hierarchy operating in the multiprogrammed environment. Optimality is defined with respect to mean system response time under a fixed cost constraint. It is assumed that the number of levels in the hierarchy as well as the capacity of the lowest level are known. The effect of the storage management strategy is characterized by the miss ratio function which, together with the device technology cost functions, is assumed to be representable by power functions. It is shown that as the arrival rate of processes and/or the number of active processes in the system increase, the optimal solution deviates considerably from that under a uniprogrammed environment. It is also shown that the solution obtained is the global optimum.

INDEX TERMS

response time, Hit-ratio function, Lagrange multipliers, memory hierarchies, multiprogramming, queuing theory

CITATION

S.T. Chanson, P.S. Sinha, "Optimization of Memory Hierarchies in Multiprogrammed Computer Systems With Fixed Cost Constraint",

*IEEE Transactions on Computers*, vol. 29, no. , pp. 611-618, July 1980, doi:10.1109/TC.1980.1675632