Version française
Home     About     Download     Resources     Contact us    

This site is updated infrequently. For up-to-date information, please visit the new OCaml website at

Browse thread
Optimizing garbage collection
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2010-11-22 (16:42)
From: Sylvain Le Gall <sylvain@l...>
Subject: Re: Optimizing garbage collection
On 22-11-2010, Damien Doligez <> wrote:
> On 2010-11-21, at 20:26, Eray Ozkural wrote:
>> I've been thinking whether some kind of doubling strategy would work for the minor heap size. What do you think?
> Sounds like an interesting idea, but what heuristic would you use?
> When everything is smooth, the running time decreases something like
> exponentially with the minor heap size, so you'd always want to
> increase the size.  How do you tell when to stop?  And then, if the
> program is not behaving uniformly, when do you decide to reduce
> the size?

How do you tell when to stop? 

Maybe you can stop when you reach (the size of the L2/L3 cache of the
processor) / number of core.

Both information are quite straight to read from /proc/cpuinfo. 

Sylvain Le Gall