ACM Home Page
Please provide us with feedback. Feedback
Optimization of Memory Hierarchies in Multiprogrammed Systems
Full text PdfPdf (1.05 MB)
Source Journal of the ACM (JACM) archive
Volume 17 ,  Issue 3  (July 1970) table of contents
Pages: 426 - 445  
Year of Publication: 1970
ISSN:0004-5411
Authors
C. V. Ramamoorthy  University of Texas at Austin, Departments of Computer Science and Electrical Engineering, Austin, Texas
K. M. Chandy  IBM Corporation, Cambridge Scientific Center, Cambridge, Massachusetts
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 34,   Citation Count: 22
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/321592.321596
What is a DOI?

ABSTRACT

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
0PLER, ASCHER. Fourth generation software: The realignment. Dalamation 13, 1 (Jan. 1967), 22-24.
2
 
3
CHANDY, K. M., AND RAMAMOORTHY, C.V. On the solution of linear programming problems with certain monotonicity constraints. Society of Industrial and Applied Mathematics, Fall Meeting, Dec. 1967.
 
4
AND Optimization of information storage systems. Inform. and Contr. 13, 6 (Dec. 1968), 509-526.
 
5
ESTRIN, G., HOPKINS, D., COGGAN, B., AND CROCKER, S.D. SNUPER COMPUTER--A computer in instrumentation automaton. Proc. AFIPS 1967 Spring Joint Comput. Conf., Vol. 30, pp. 645-656.
6
 
7
DOIG, A., AND LAND, A.H. An automatic method of solving discrete programming problems. Econometrica 28 (1960), 497-520.
 
8
KOLESAR, P .J . A branch and bound algorithm for the knapsack problem. Manage. Sci. 18, 9 (1967), 723--735.
 
9
RAMAMOORTHY, C. V., AND TSUCHIYA, M. A study of user-microprogrammable computers. Proc. AFIPS 1970 Spring Joint Comput. Conf., Vol. 36, pp. 165-181 (AFIPS Press, Montvale, N. J.).

CITED BY  22

Collaborative Colleagues:
C. V. Ramamoorthy: colleagues
K. M. Chandy: colleagues