Optimal Design of Linear Storage Hierarchies

Abstract

The performance-oriented design of linear storage hierarchies whtch are operating m muluprogramming environments ~s constdered An opt~mtzaUon model is superimposed upon an exponential queuing network model of the hterarchy, yteldmg a problem whose objectwe is to maxlmme throughput subject to a cost constraint. The dects~on variables are the speeds and capacmes of the various memory levels. It is shown that any local optimum is indeed a globally opumal solution to the problem. Several specml cases of and extensions to the basic problem are discussed, and some examples are given to dlustrate the usefulness and computational tractabihty of the problem