Path: csiph.com!weretis.net!feeder6.news.weretis.net!news.misty.com!news.iecc.com!.POSTED.news.iecc.com!nerds-end From: Spiros Bousbouras Newsgroups: comp.compilers Subject: Looking for a garbage collection paper Date: Tue, 20 Sep 2022 09:29:24 -0000 (UTC) Organization: A noiseless patient Spider Lines: 24 Sender: news@iecc.com Approved: comp.compilers@iecc.com Message-ID: <22-09-011@comp.compilers> Mime-Version: 1.0 Content-Type: text/plain; charset=ISO-8859-1 Content-Transfer-Encoding: 8bit Injection-Info: gal.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="11018"; mail-complaints-to="abuse@iecc.com" Keywords: GC Posted-Date: 20 Sep 2022 11:21:19 EDT X-submission-address: compilers@iecc.com X-moderator-address: compilers-request@iecc.com X-FAQ-and-archives: http://compilers.iecc.com Xref: csiph.com comp.compilers:3163 The book "Garbage collection: algorithms for automatic dynamic memory management" by Jones and Lins starts describing on page 197 a concurrent garbage collection algorithm by Leslie Lamport and concludes on page 198 with : "This colour change is done in a single instruction by an ingenious reinterpretation of colour values by incrementing the value of a base colour modulo 3: interested readers should consult [Lamport, 1976] for more details." Ok ; if it's ingenious , I want to read it. The reference is Leslie Lamport Garbage Collection with Multiple Processes: an Exercise in Parallelism Proceedings of the 1976 International Conference on Parallel Processing, T. Feng, ed., 50-54. I did a bit of googling , arrived at http://lamport.azurewebsites.net/pubs/pubs.html and it says "No electronic version available". The entry on the page for the above paper references "On-the-fly Garbage Collection: an Exercise in Cooperation" and I have downloaded that but ideally I would also like to see the above paper. So I was wondering whether anyone has a copy. If the algorithm is not too long , perhaps they can post it here (as pseudocode) ; or , if they are willing to scan the paper , contact Lamport and ask him if he would like a scanned version which he can put on his website.