Exploring the barrier to entry: incremental generational garbage collection for Haskell

We document the design and implementation of a “production” incremental garbage collector for GHC 6.2. It builds on our earlier work (Non-stop Haskell) that exploited GHC’s dynamic dispatch mechanism to hijack object code pointers so that objects in to-space automatically scavenge themselves when the mutator attempts to “enter” them. This paper details various optimisations based on code specialisation that remove the dynamic space, and associated time, overheads that accompanied our earlier scheme. We detail important implementation issues and provide a detailed evaluation of a range of design alternatives in comparison with Non-stop Haskell and GHC’s current generational collector. We also show how the same code specialisation techniques can be used to eliminate the write barrier in a generational collector. Categories and Subject Descriptors: D.3.4 [Programming Languages]: Processors—Memory management (garbage collection) General Terms: Algorithms, Design, Experimenta...

• Type: Conference
• Year: 2004
• Where: IWMM
• Authors: Andrew M. Cheadle, A. J. Field, Simon Marlow, Simon L. Peyton Jones, R. Lyndon While
• Keywords: Code Specialisation, Generational Collector, Hardware, IWMM 2004, Non-stop Haskell