[
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: | -- (:) |
| From: | Damien Doligez <damien.doligez@i...> |
| Subject: | Re: [Caml-list] Performance-question |
On 2008-02-05, at 14:33, Oliver Bandel wrote: > Each sample counts as 0.01 seconds. > % cumulative self self total > time seconds seconds calls s/call s/call name > 44.45 163.08 163.08 26627 0.01 0.01 mark_slice > 22.31 244.92 81.84 38447 0.00 0.00 sweep_slice > 14.40 297.74 52.82 131 0.40 0.61 caml_compact_heap > 3.49 310.54 12.80 372416920 0.00 0.00 > invert_pointer_at > 3.40 323.02 12.48 560604006 0.00 0.00 compact_allocate > 3.12 334.45 11.43 9725772 0.00 0.00 caml_fl_allocate > 0.92 337.81 3.36 25607 0.00 0.00 caml_add_to_heap That's a lot of time spent in the compactor, indicating that your program has a memory fragmentation problem. I would be very interested in getting a copy of your program and data, as I'm currently experimenting with new allocation policies designed to reduce fragmentation. This would make a good benchmark for me. More generally, I'm looking for (small) programs that exhibit this kind of behaviour: they call the compactor frequently and their memory usage grows without bound when the compactor is disabled. -- Damien