Browse thread
Optimizing garbage collection
[
Home
]
[ Index:
by date
|
by threads
]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: | 2010-11-22 (15:10) |
From: | Damien Doligez <damien.doligez@i...> |
Subject: | Re: [Caml-list] Optimizing garbage collection |
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? -- Damien