A Caltech Library Service

Optimization of Memory Hierarchies in Multiprogrammed Systems

Ramamoorthy, C. V. and Chandy, K. M. (1970) Optimization of Memory Hierarchies in Multiprogrammed Systems. Journal of the ACM, 17 (3). pp. 426-445. ISSN 0004-5411.

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item:


The optimization of memory hierarchy involves the selection of types and sizes of memory devices such that the average access time to an information block is a minimum for a particular cost constraint. It is assumed that the frequency of usage of the information is known a priori. In this paper the optimization theory for a single task or program is reviewed and it is extended to a general case in multiprogramming when a number of tasks are executed concurrently. Another important extension treats the case when memories are available only in indivisible modules. Comparisons with conventional methods of solution as well as computational experience on the multiprogrammed and modular cases are given.

Item Type:Article
Related URLs:
URLURL TypeDescription
Additional Information:© 1970 ACM. Received December 1967; Revised November 1969. The authors sincerely thank Mr. Richard Collier, graduate student at the University of Texas, for programming and simulation help.
Subject Keywords:memory hierarchy, optimization, multiprogramming
Issue or Number:3
Classification Code:CR Categories: 6.2
Record Number:CaltechAUTHORS:20190110-155953410
Persistent URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:92206
Deposited By: Tony Diaz
Deposited On:11 Jan 2019 05:03
Last Modified:03 Oct 2019 20:42

Repository Staff Only: item control page