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
[Caml-list] Array Optimizations
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: Thorsten Ohl <ohl@h...>
Subject: [Caml-list] Array Optimizations
Christophe TROESTLER writes:

> P.S.  As outlined in the paper, the Bigarray library is really slow
> (much slower than the standard Array).  Given its (other)
> capabilities, it is tempting to use it for numeric processing
> however.

I never noticed that Bigarray was so much slower, because I only
started to use it after standard Arrays outgrew my memory.  In this
case, the speedup from mapped Bigarrays relative to mildly thrashing
standard Arrays to was dramatic and masked the slowdown completely.

I didn't know that all accesses are going through the general
interface.   Inlining accesses in the native compiler for Arrays with
fixed dimensions could be a tremendous performance boost.

> Until this is solved,

I currently have a program that vitally depends on Bigarrays for
numeric processing.  The runtime is still on the order of hours and I
wouldn't want to rewrite it in Fortran anyway, but a factor 10 speedup
would be really cool :-).


> The Omega Project:

Darn, somebody used that name before ...
Thorsten Ohl, Physics Department, TU Darmstadt -- [<=== PGP public key here]
Bug reports:  FAQ:
To unsubscribe, mail  Archives: