English version
Accueil     À propos     Téléchargement     Ressources     Contactez-nous    

Ce site est rarement mis à jour. Pour les informations les plus récentes, rendez-vous sur le nouveau site OCaml à l'adresse ocaml.org.

Browse thread
Memory allocation nano-benchmark.
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2005-02-11 (20:44)
From: Oliver Bandel <oliver@f...>
Subject: Re: [Caml-list] Memory allocation nano-benchmark.
On Thu, Feb 10, 2005 at 08:20:03PM +0100, Christian Szegedy wrote:
[...]
> Actually, I have *filled* the arrays, as it may be clear from
> the code. 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.)
> 
> 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.

What does this mean?
Is only the work on the grid faster, or is the program
all in all (mem allocation AND working on the grid)
faster in OCaml or in C?

What does count more?

Being faster in subatsks, or getting the whole computation
done in a shorter time?


Ciao,
   Oliver