A Fortran-Compiled List-Processing Language
Journal of the ACM (JACM)
Recursive functions of symbolic expressions and their computation by machine, Part I
Communications of the ACM
Communications of the ACM
An efficient machine-independent procedure for garbage collection in various list structures
Communications of the ACM
| Hi-index | 48.23 |
The concept of an available-space list was introduced by Newell and Shaw [1] in 1957, and has since been incorporated into a number of different systems [2-5]. The available-space list (or “free list”) is a list of all available memory locations. It should initially be as large as possible, and ideally it would contain every cell not used by the program. The subject of this note is the initial formation of a free list on the IBM 7090-7094, using the FORTRAN II monitor, version 2. The method presented originated while the authors were working on an implementation of the WISP [5] system for the 7090 in cooperation with Prof. M. V. Wilkes and his colleagues.