SRC Research Report 25

Real-time Concurrent Collection on Stock Multiprocessors.

John R. Ellis, Kai Li, and Andrew W. Appel

We've designed and implemented a copying garbage-collection algorithm that is efficient, real-time, concurrent, runs on commercial uniprocessors and shared-memory multiprocessors, and requires no change to compilers. The algorithm uses standard virtual-memory hardware to detect references to "from space" objects and to synchronize the collector and mutator threads. We've implemented and measured a prototype running on SRC's 5-processor Firefly. It will be straightforward to merge our techniques with generational collection. An incremental, non-concurrent version could be implemented easily on many versions of Unix.

Back to the SRC Research Reports main page.

• PostScript compressed with UNIX compress -- 1496 Kbytes
  
• PostScript compressed with GNU compress (gzip) -- 1264 Kbytes
  
• PostScript compressed with ZIP -- 1264 Kbytes
  
• PostScript -- 1600 Kbytes
  
• Portable Document Format (PDF) -- 1224 Kbytes