> Subject :Re: [Caml-list] Slow GC problem
> From :Damien Doligez < Damien.Doligez@inria.fr >
> Date: Tue, 8 Apr 2003 12:23:46 +0200
> Cc: caml-list@inria.fr
> In-Reply-To: < 3C821F52-66D5-11D7-A265-000393942C76@ece.ucsb.edu >
> > I have a gc efficiency problem for which I require some advice. I 
> have
> > read both the O'Reilly book and the manual on gc.
> [...]
> >  Below I give the gc stats just before and after the solver routine 
> is
> > called in the in-core solver:
> >
> >                               "Just before"   "Just after"
> > minor_words:          46243376        139259767
> > promoted_words:       928267          2595523
> > major_words:          2883087         39489766
> > minor_collections:    1412            4591
> > major_collections:    18                      52
> > heap_words:           2150400         1044480
> > heap_chunks:          35                      17
> > top_heap_words:       2150400         5038080
> > live_words:           1842373         840037
> > live_blocks:          253926          116816
> > free_words:           307180          204440
> > free_blocks:          47368           17
> > largest_free:         10928           61440
> > fragments:            847                     3
> > compactions:          0                       2
>
> As others have said, this is not really enough information to tell
> what is going on.  What we can say from the above is:
>
> 1. You are allocating lots and lots of data structures in the major
>     heap (maybe finalized bigarray descriptors)
> 2. The compactor was called twice, which may indicate that you have
>     a fragmentation problem.
> 3. The compactor was called near the end of the solver routine,
>     which must have erased most of the evidence...
>
> -- Damien 
--shiv--