A Note on the Optimal Allocation of Spaces in MACLISP
Name
AI_WP_142.pdf
Description
Main article
Size
250.79 KB
Format
Adobe PDF
Checksum (MD5)
1c94653a554277371617b06d9dba299b
Author(s)
Baker, Henry G. Jr.
Date Issued
March 16, 1977
Publisher
MIT Artificial Intelligence Laboratory
Series/Report no.
MIT Artificial Intelligence Laboratory Working Papers, WP-142;
Abstract
This note describes a method for allocating storage among the various spaces in the MACLISP Implementation of LISP. The optimal strategy which minimizes garbage collector effort allocates free storage among the various spaces in such a way that they all run out at the same time. In an equilibrium situation, this corresponds to allocating free storage to the spaces in proportion to their usage.
Methods are investigated by which the rates of usage can be inferred, and a gc-daemon interrupt handler is developed which implements an approximately optimal strategy in MACLISP. Finally, the sensitivity of this method to rapidly varying differential rates of cell usage is discussed.
Description
Key Words and Phrases: garbage collection, list processing, virtual memory, storage management, storage allocation, LISP.
CR Categories: 3.50, 3.60, 3.73, 3.80, 4.13, 422, 4.32, 4.33, 4.35, 4.49
This report describes research done at the Artificial Intelligence Laboratory of the Massachusetts Institute of Technology. Support for the laboratory's artificial intelligence research is provided in part by the Advanced Research Projects Agency of the Department of Defense under Office of Naval Research contract N00014-75-C-0522.
Subjects
LISP
storage allocation
storage management
virtual memory
list processing
garbage collection
Persistent DSpace Link
