Re: [Caml-list] Can this code be accelerated by porting it to SPOC, SAREK or MetaOCaml ?

[Ronan Le Hy <ronan.lehy@gmail.com>]

Hi François,

2017-06-15 8:28 GMT+02:00 Francois BERENGER <berenger@bioreg.kyushu-u.ac.jp>:
> I am wondering if some high performance OCaml experts out there
> can know in advance if some code can go faster by executing it
> on a GPU.
> I have some clear bottleneck in my program.
> Here is how the code looks like:
> ---
> let f (points: (Vector3.t * float) list) =
>   let acc = ref [] in
>   let ac p1 x (p2, y) =
>     acc := (Vector3.dist p1 p2, x *. y) :: !acc
>   in
>   let rec loop = function
>     | [] -> ()
>     | (p1, x) :: xs ->
>       L.iter (ac p1 x) xs;
>       loop xs
>   in
>   loop points;
>   !acc

As a baseline before attempting anything on the GPU, I'd vectorize
this. Put all your vectors in a big matrix. Put all your numbers in a
vector. Compute the distances and the products all at once using
Lacaml (make sure you use OpenBLAS as a backend). I'd expect it to be
much faster than the above loop already.

-- 
Ronan