Browse thread
[Caml-list] Bigarray access speed
[
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: | 2002-08-16 (10:28) |
From: | malc <malc@p...> |
Subject: | Re: [Caml-list] Bigarray access speed |
On Fri, 16 Aug 2002, Richard Nyberg wrote: > In the following small programs 3) is faster than 1) and 2), which run > equally fast. However, 4 is significantly slower than the rest. If you > change the line "a.{i} <- a.{i} + i" to "a.{i} <- i" the execution time > is halfed but it's still much slower. > > Are access to Bigarrays slower when passed to functions? If so, is it > fixable? or is there some workaround? > > I stumbled upon this while coding on a school assignment ((not too ;) fast > multiplication of large integers). > > 1) > let a = Array.make 1000000 0 in > for i = 0 to 999999 do > a.(i) <- a.(i) + i; > done;; > > 2) > let a = Array.make 1000000 0 in > let rec loop a i = > if i <= 999999 then begin > a.(i) <- a.(i) + i; > loop a (i + 1) > end in > loop a 0;; > > 3) > open Bigarray;; > let a = Array1.create int c_layout 1000000 in > Array1.fill a 0; > for i = 0 to 999999 do > a.{i} <- a.{i} + i > done;; > > 4) > open Bigarray;; > let a = Array1.create int c_layout 1000000 in > Array1.fill a 0; > let rec loop a i = > if i <= 999999 then begin > a.{i} <- a.{i} + i; > loop a (i + 1) > end in > loop a 0;; http://caml.inria.fr/archives/200110/msg00148.html An aside(not all facts are cheked): Bigarrays(of at least floats) can have a slight edge over normals arrays. To get maximal speed of the inner loops data needs to be naturally aligned. OCaml does nothing to enforce it for non-big arrays. Bigarrays on the other hand are mmaped(4k on IA32) and you get perfectly aligned data for free. I was thinking that maybe Array can be extended with make[create]_aligned, for speed/space tradeoff. -- mailto:malc@pulsesoft.com ------------------- To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/ Beginner's list: http://groups.yahoo.com/group/ocaml_beginners