[
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: | Jon Harrop <jon@f...> |
| Subject: | Re: [Caml-list] Performance-question |
On Thursday 07 February 2008 16:13:25 Damien Doligez wrote: > 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. The "n"th-nearest neighbor example from OCaml for Scientists is certainly very allocation intensive because it makes extensive use of the Set module: http://www.ffconsultancy.com/products/ocaml_for_scientists/complete/ but I'm not sure that its memory use will grow unbounded if compaction is disabled though. -- Dr Jon D Harrop, Flying Frog Consultancy Ltd. http://www.ffconsultancy.com/products/?e