Optimization of Memory Hierarchies in Multiprogrammed Systems
Journal of the ACM (JACM)
Optimization of Static Loading and Sizing of Multilevel Memory Systems
Journal of the ACM (JACM)
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
Journal of the ACM (JACM)
Product Form and Local Balance in Queueing Networks
Journal of the ACM (JACM)
Optimal Selection of CPU Speed, Device Capacities, and File Assignments
Journal of the ACM (JACM)
Optimal Design of Linear Storage Hierarchies
Journal of the ACM (JACM)
The Operational Analysis of Queueing Network Models
ACM Computing Surveys (CSUR)
Operating Systems Theory
File Assignment in Memory Hierarchies
Proceedings of the International Workshop organized by the Commision of the European Communities on Modelling and Performance Evaluation of Computer Systems
A performance comparison of optimally designed computer systems with and without virtual memory
ISCA '79 Proceedings of the 6th annual symposium on Computer architecture
Hardware configuration selection through discretizing a continuous variable solution
PERFORMANCE '80 Proceedings of the 1980 international symposium on Computer performance modelling, measurement and evaluation
Seeking configurational optimization in computer systems
ACM '75 Proceedings of the 1975 annual conference
Probability models of multiprogrammed computer systems.
Probability models of multiprogrammed computer systems.
Analysis and applications of probabilistic models of multiprogrammed computer systems.
Analysis and applications of probabilistic models of multiprogrammed computer systems.
A Decision Model for Closed Queuing Networks
IEEE Transactions on Software Engineering
Selecting Capacities in Computer Communication Systems
IEEE Transactions on Software Engineering
| Hi-index | 14.98 |
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.