[Haskell-cafe] GHC 7.0.1 developer challenges

Simon Marlow marlowsd at gmail.com
Thu Dec 16 10:13:41 CET 2010

On 16/12/2010 00:37, John D. Ramsdell wrote:
> On Wed, Dec 15, 2010 at 7:59 AM, Simon Marlow<marlowsd at gmail.com>  wrote:
>>   The -M flag causes the GC algorithm to switch from copying (fast but
>> hungry) to compaction (slow but frugal) as the limit approaches.
> Ah, so that's what it's doing.  My measurements say that part of the
> code is working well.  Of course, my conclusion is based on a tiny
> sample size.

If your program has large memory requirements, you might also benefit 
from parallel GC in the old generation: +RTS -N2 -qg1.


More information about the Haskell-Cafe mailing list