Run-time storage management
The generation of executable machine code is obviously completely conditioned by the storage allocation techniques which are to be used at run-time. We have tried to give some idea of the basic storage allocation mechanisms, without going into too much detail. It should be noted that an extremely wide variety of techniques exist, and many interesting ideas have not been discussed here. However, most of the variety stems from efforts to improve the basic themes that we have developped, or to adapt them to particular machines.
One point of importance is the very close relationship between storage allocation mechanisms and the type of operations which may exist in the language. Small changes in language design can lead to large changes in the architecture of the compiler and in the complexity of the run-time system.
KeywordsData Block Garbage Collection Block Entry Free List Data Zone
Unable to display preview. Download preview PDF.
- J.W. BACKUS et al. Report on the Algorithmic Language ALGOL60 CACM, Vol. 3, No5, May 1960Google Scholar
- E.W. DIJKSTRA ALGOL60 Translation Supplement, ALGOL Bulletin 10, 1960Google Scholar
- D. GRIES Compiler Construction for Digital Computers Wiley, 1971Google Scholar
- M. GRIFFITHS Langages Algorithmiques et Compilateurs Course Notes, University of Grenoble, 1971Google Scholar
- I. B. M. PL/1 Language Specifications IBM Form C28-6571, 1965Google Scholar
- B. RANDELL, L.J. RUSSELL ALGOL60 Implementation Academic Press, 1964Google Scholar
- B.A. WICHMANN ALGOL60 Compilation and Assessment Academic Press, 1973Google Scholar
- A. van Wijngaarden et al. Report on the Algorithmic Language ALGOL68 Num. Math. 14, pp. 79–218, 1969Google Scholar
- N. WIRTH, C.A.R. HOARE A Contribution to the Development of ALGOL CACM, Vol.9, No 6, June 1966Google Scholar