Advanced Search
DSpace@MIT

A LISP Garbage Collector Algorithm Using Serial Secondary Storage

Research and Teaching Output of the MIT Community

Show simple item record

dc.contributor.author Minsky, M.L. en_US
dc.date.accessioned 2004-10-04T14:37:44Z
dc.date.available 2004-10-04T14:37:44Z
dc.date.issued 1963-12-27 en_US
dc.identifier.other AIM-058 en_US
dc.identifier.uri http://hdl.handle.net/1721.1/6080
dc.description.abstract This paper presents an algorithm for reclaiming unused free storage memory cells in LISP. It depends on availability of a fast secondary storage device, or a large block of available temporary storage. For this price, we get: 1.) Packing of free-storage into a solidly packed block. 2.) Smooth packing of arbitrary linear blocks and arrays. 3.) The collector will handle arbitrarily complex re-entrant list structure with no introduction of spurious copies. 4.) The algorithm is quite efficient; the marking pass visits words at most twice and usually once, and the loading pass is linear. 5.) The system is easily modified to allow for increase in size of already fixed consecutive blocks, provided one can afford to initiate a collection pass or use a modified array while waiting for such a pass to occur. en_US
dc.format.extent 4 p. en_US
dc.format.extent 2640867 bytes
dc.format.extent 155151 bytes
dc.format.mimetype application/postscript
dc.format.mimetype application/pdf
dc.language.iso en_US
dc.relation.ispartofseries AIM-058 en_US
dc.title A LISP Garbage Collector Algorithm Using Serial Secondary Storage en_US


Files in this item

Name Size Format Description
AIM-058.ps 2.518Mb Postscript
AIM-058.pdf 151.5Kb PDF

This item appears in the following Collection(s)

Show simple item record

MIT-Mirage