A Dynamic Memory Allocation Algorithm
- 1 May 1970
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-19 (5) , 403-411
- https://doi.org/10.1109/t-c.1970.222938
Abstract
A dynamic memory allocation algorithm is presented making use of a priori information about a computer program. A two- level storage system is assumed, and a replacement algorithm is developed based upon a priori knowledge of interaction factors between any two space-taking entities associated with a computation.Keywords
This publication has 11 references indexed in Scilit:
- Bounds for Maxium Parallelism in a Bilogic Graph Model of ComputationsIEEE Transactions on Computers, 1969
- Path Length Computations on Graph Models of ComputationsIEEE Transactions on Computers, 1969
- Measurement based automatic analysis of FORTRAN programsPublished by Association for Computing Machinery (ACM) ,1969
- Models of Computations and Systems—Evaluation of Vertex Probabilities in Graph Models of ComputationsJournal of the ACM, 1967
- A study of replacement algorithms for a virtual-storage computerIBM Systems Journal, 1966
- Segmentation and the Design of Multiprogrammed Computer SystemsJournal of the ACM, 1965
- Program organization and record keeping for dynamic storage allocationCommunications of the ACM, 1961
- A note on the application of graph theory to digital computer programmingInformation and Control, 1960
- A New Method of Checking the Consistency of Precedence MatricesJournal of the ACM, 1959
- Applications of Boolean matrices to the analysis of flow diagramsPublished by Association for Computing Machinery (ACM) ,1959