New LISP techniques for a paging environment

ABSTRACT

The system described herein employs the block concept, and that of global and local variables, in addition to the methods applied in most LISP systems. Also, a new means of list representation is used: “local sequential” for lists created during compilation, and “block level sequential” for those created dynamically. A new garbage collection algorithm has been introduced to make lists as compact as possible; partial garbage collection is performed after each block exit instead of total garbage collection when storage is exhausted. The algorithm does not use the customary flagging procedure. This combination of features has eliminated the need for a free list, and effectively minimizes the number of pages used at any moment.

REFERENCES

• 1: Rutishauser, H. Description of ALGOL 60, Vol. 1, Pt. A. Springer-Verlag, New York.
• 2: Donald E. Knuth, The art of computer programming, volume 1 (3rd ed.): fundamental algorithms, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1997
• 3: John McCarthy, LISP 1.5 Programmer's Manual, The MIT Press, 1962
• 4: Wilfred J. Hansen, Compact list representation: definition, garbage collection, and system implementation, Communications of the ACM, v.12 n.9, p.499-507, Sept. 1969 [doi>10.1145/363219.363225]
• 5: Daniel G. Bobrow , Daniel L. Murphy, Structure of a LISP system using two-level storage, Communications of the ACM, v.10 n.3, p.155-159, March 1967 [doi>10.1145/363162.363185]
• 6: Daniel G. Bobrow , Daniel L. Murphy, A note on the efficiency of a LISP computation in a paged machine, Communications of the ACM, v.11 n.8, p.558, Aug. 1968 [doi>10.1145/363567.363581]

INDEX TERMS

Keywords:
LISP, block, compact list structures, core fragmentation, garbage collection, list processing, paging, segment, virtual memory