This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Optimal Design of Multilevel Storage Hierarchies
March 1982 (vol. 31 no. 3)
pp. 249-260
R.M. Geist, Department of Computer Science, Duke University
An optimization model is developed for assigning a fixed set of files across an assemblage of storage devices so as to maximize system throughput. Multiple levels of executable memories and distinct record sizes for separate files are allowed. Through the use of this model, a general class of file assignment problems is reduced to the optimization of a convex function over a convex feasible region. A high-speed search procedure specifically tailored to solve this optimization problem is then presented, along with numerical examples from real systems which demonstrate orders of magnitude improvement in execution time over existing routines for solving the file-assignment problem. The optimal device capacity selection problem is then solved by simply calling the file assignment routine for each candidate set of device capacities.
Index Terms:
queueing networks, Capacity selection, file-assignment problem, optimization, performance evaluation, performance-oriented design
Citation:
R.M. Geist, K.S. Trivedi, "Optimal Design of Multilevel Storage Hierarchies," IEEE Transactions on Computers, vol. 31, no. 3, pp. 249-260, March 1982, doi:10.1109/TC.1982.1675981
Usage of this product signifies your acceptance of the Terms of Use.