Browse thread
Re: [Caml-list] Optimizing garbage collection
- Damien Doligez
[
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-23 (09:48) |
From: | Damien Doligez <damien.doligez@i...> |
Subject: | Re: [Caml-list] Optimizing garbage collection |
On 2010-11-22, at 19:38, John Carr wrote: > I don't understand "smooth". Minor heap size should be based on the > rate of garbage generation relative to allocation to balance cache > misses with GC cost. The ratio may be small or large independent of > whether it varies during the program. What I meant is that, if the allocation rate of the program is infinitely regular and you don't get any threshold effects, the running time decreases as the minor heap size increases, and it's hard to tell when you should stop increasing it. For benchmarks the best choice is probably the physical memory size, but you certainly don't want your real programs to do that. -- Damien