Thumbnail
Access Restriction
Subscribed

Author Rochfeld, Arnold
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Compact list structures ♦ Garbage collection ♦ List processing ♦ Virtual memory ♦ Paging ♦ Block ♦ Core fragmentation ♦ Lisp ♦ Segment
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.
Description Affiliation: Univ. of Edinburgh, Scotland (Rochfeld, Arnold)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 14
Issue Number 12
Page Count 5
Starting Page 791
Ending Page 795


Open content in new tab

   Open content in new tab
Source: ACM Digital Library