Browse thread
Memory allocation nano-benchmark.
[
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: | 2005-02-10 (19:38) |
From: | Jon Harrop <jon@j...> |
Subject: | Re: [Caml-list] Memory allocation nano-benchmark. |
On Thursday 10 February 2005 19:20, Christian Szegedy wrote: > ... This example was extracted from a program which > massively shuffles around the content of this 3-dimensional grid. > (Both work fine and yield identical output.) Perhaps a non-uniform data structure would be more suitable? OCaml would really shine at this... > To my astonishment, the OCaml was a bit faster than C when > working on the grid, but the speed of allocation was nowhere > near to that of the C version. Yes, there is a lot of overhead when doing this in ocaml. > This was a surprise to me, since I thought that OCaml is quite > competitive in this regard. No, I've also found this with a wavelet transform too. The time taken to do the transform was within a few percent but the time taken to initialise was double for ocaml compared to C, IIRC. -- Dr Jon D Harrop, Flying Frog Consultancy Ltd.