On 2010-11-29, at 23:27, Török Edwin wrote:
This seems to be in concordance with the smaller minor heap = more
minor collections = slower program observation, since it is:
smaller minor heap = more minor collections = more major slices =
major slices can't collect long-lived objects = slower
On Thu, 2 Dec 2010 13:57:23 +0100
Damien Doligez damien.doli...@inria.fr wrote:
On 2010-11-29, at 23:27, Török Edwin wrote:
This seems to be in concordance with the smaller minor heap = more
minor collections = slower program observation, since it is:
smaller minor heap = more minor
On Nov 29, 2010, at 00:34 , Jon Harrop wrote:
I see. Yes, that sounds like a great idea. How well does Immix cope with
high allocation rates of short-lived objects? Been a while since I read the
Immix paper...
In theory this should be handled more efficiently compared to a generational
On Sun, 28 Nov 2010 15:29:08 +0100
Benedikt Meurer benedikt.meu...@googlemail.com wrote:
Speaking of the OCaml GC in general, wouldn't it make sense to
replace the current generational collector with a collector framework
that requires less copying in the common case.
Even without changing
Le 27/11/10 22:11, Pierre Etchemaïté a écrit :
Le Mon, 22 Nov 2010 20:33:34 +0200, Török Edwin edwinto...@gmail.com a
écrit :
Not sure what the max should be for the minor heap increase, but based
on this benchmark increasing size of minor heap never slows down the
program. Even when size
On Sun, Nov 28, 2010 at 4:29 PM, Benedikt Meurer
benedikt.meu...@googlemail.com wrote:
Speaking of the OCaml GC in general, wouldn't it make sense to replace the
current generational collector with a collector framework that requires less
copying in the common case. For example, dividing the
@yquem.inria.fr
Subject: Re: [Caml-list] OCaml GC [was Is OCaml fast?]
On Sun, Nov 28, 2010 at 4:29 PM, Benedikt Meurer
benedikt.meu...@googlemail.com wrote:
Speaking of the OCaml GC in general, wouldn't it make sense to replace the
current generational collector with a collector framework
On Nov 28, 2010, at 20:40 , Jon Harrop wrote:
I don’t understand why this would help here though. Wouldn’t that help when a
long-lived structure was single large block but, in this case, the long-lived
structure is a tree composed of many small heap-allocated blocks and,
therefore, they
] On Behalf Of Benedikt Meurer
Sent: 28 November 2010 20:00
To: caml-list@yquem.inria.fr
Subject: Re: [Caml-list] OCaml GC [was Is OCaml fast?]
On Nov 28, 2010, at 20:40 , Jon Harrop wrote:
I don't understand why this would help here though. Wouldn't that
help when a long-lived structure
