A LISP Garbage Collector Algorithm Using Serial Secondary Storage

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/6080

Full metadata record

DC Field	Value	Language
dc.creator	Minsky, M.L.	-
dc.date	2004-10-04T14:37:44Z	-
dc.date	2004-10-04T14:37:44Z	-
dc.date	1963-12-27	-
dc.date.accessioned	2013-10-09T02:42:46Z	-
dc.date.available	2013-10-09T02:42:46Z	-
dc.date.issued	2013-10-09	-
dc.identifier	AIM-058	-
dc.identifier	http://hdl.handle.net/1721.1/6080	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	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.	-
dc.format	4 p.	-
dc.format	2640867 bytes	-
dc.format	155151 bytes	-
dc.format	application/postscript	-
dc.format	application/pdf	-
dc.language	en_US	-
dc.relation	AIM-058	-
dc.title	A LISP Garbage Collector Algorithm Using Serial Secondary Storage	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI