Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!cs.utexas.edu!uwm.edu!gem.mps.ohio-state.edu!tut.cis.ohio-state.edu!att!cbnewsc!lgm
From: lgm@cbnewsc.ATT.COM (lawrence.g.mayka)
Newsgroups: comp.lang.lisp
Subject: Real-time garbage collection on stock hardware, for Lisp
Keywords: memory reclamation, incremental, per-page access protection
Message-ID: <3123@cbnewsc.ATT.COM>
Date: 13 Sep 89 07:14:22 GMT
Organization: AT&T Bell Laboratories
Lines: 20


Is any commercial Common Lisp vendor using, or planning to use,
a genuinely real-time garbage collector on a conventional processor?
For example, has any vendor implemented the promising algorithm
described by Appel, Ellis, and Li in "Real-time Concurrent Collection
on Stock Multiprocessors," Proceedings of the SIGPLAN '88 Conference
on Programming Language Design and Implementation, SIGPLAN Notices 23:7,
July 1988?  Their algorithm makes use of per-page access protections
to reclaim memory in a truly incremental fashion.  (Despite the article's
title, the algorithm does not require a multiprocessor, but it can
handle that case, too.)  Or has anyone installed such a garbage
collector into Kyoto Common Lisp?

For that matter, has any researcher attempted to implement an algorithm
such as that of Appel, Ellis, and Li for any dialect of Lisp?


	Lawrence G. Mayka
	AT&T Bell Laboratories
	lgm@ihlpf.att.com