[Haskell-cafe] GHC 7.0.1 developer challenges
John D. Ramsdell
ramsdell0 at gmail.com
Thu Dec 16 01:37:18 CET 2010
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.
John
More information about the Haskell-Cafe
mailing list