Version française
Home     About     Download     Resources     Contact us    

This site is updated infrequently. For up-to-date information, please visit the new OCaml website at

Browse thread
Impact of GC on memoized algorithm
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2005-03-30 (12:03)
From: Jon Harrop <jon@f...>
Subject: Re: [Caml-list] Impact of GC on memoized algorithm
On Wednesday 30 March 2005 09:39, Alex Baretta wrote:
> I have come to think that the difference in performance might be
> attributable to the garbage collector.

Try to objectively quantify the performance bottleneck using profiling, rather 
than speculating. Most of the time, most of the people speculate 
incorrectly. :-)

In this case, if you are using an inappropriate data structure as the key to 
the hash table then you may be getting a lot of clashes. In which case, lots 
of time will be spent looking up elements in hash table's own list 
implementation. IIRC, most of the time will then be spent in the 
Hashtbl.find_rec function...

Dr Jon D Harrop, Flying Frog Consultancy Ltd.
Objective CAML for Scientists