Hello,

May be running a minimisation algorithm to minimize (promoted_words per
minor collection / minor_heap_size)  Could be good ?

If we retain the value of this ration for the last N minor_collection,
we can surely guess
a good value for the next cycle (using trichomomy for instance) ...

I will have a look if nobody elso does before me.

Unfortunately to write this in OCaml itself is not so easy: there are no
alarm for minor collection cycle, so will only get values for major
cycle or via a timer with fixed intervals ...

Cheers,
Christophe


-- 
Christophe Raffalli
Universite de Savoie
Batiment Le Chablais, bureau 21
73376 Le Bourget-du-Lac Cedex

tel: (33) 4 79 75 81 03
fax: (33) 4 79 75 87 42
mail: Christophe.Raffalli@univ-savoie.fr
www: http://www.lama.univ-savoie.fr/~RAFFALLI
---------------------------------------------
IMPORTANT: this mail is signed using PGP/MIME
At least Enigmail/Mozilla, mutt or evolution 
can check this signature. The public key is
stored on www.keyserver.net
---------------------------------------------