[Haskell-cafe] Re: Real-time garbage collection for Haskell
Malcolm.Wallace at cs.york.ac.uk
Tue Mar 2 09:11:52 EST 2010
> Both concurrent GC and incremental GC tend to add overheads to the
> mutator, because they need a read barrier. There was an incremental
> GC for GHC once , taking advantage of the built-in read barrier
> that we have whereby most closures are "entered"
Was there a specific reason why that GC implementation chose to use a
read barrier rather than a write barrier? I would have thought that
in general, a write barrier is cheaper to implement. Doesn't ghc
update fewer thunks than it enters?
More information about the Haskell-Cafe