Path: utzoo!utgpu!jarvis.csri.toronto.edu!cs.utexas.edu!tut.cis.ohio-state.edu!snorkelwacker!mit-eddie!attctc!smunews!ti-csl!m2!djohnson From: djohnson@m2.csc.ti.com (Doug Johnson) Newsgroups: comp.lang.lisp Subject: Re: Garbage collection algorithms Message-ID: <108553@ti-csl.csc.ti.com> Date: 1 Feb 90 16:09:31 GMT References: <366@argosy.UUCP> <1990Jan22.111348.5585@Neon.Stanford.EDU> Sender: news@ti-csl.csc.ti.com Organization: TI Computer Science Center, Dallas Lines: 15 In article bds@mbunix.mitre.org (Smith) writes: > >I have a paper written by Bob Courts of TI called "Improving Locality >of Reference in a Garbage-Collecting Memory Management System" that >describes how TI implemented gc on the Explorer. I found it to be an >interesting paper, and well worth reading. It was given to me by a TI >salesman, and I don't know if it was ever published. It was published in Communications of the ACM, September 1988. While there is some discussion of GC in general, it focuses on GC in a virtual memory environment. I believe the tradeoffs are very different in a physical memory system. Paul Wilson's suggestions are close to what I'd try. -- Doug