Browse thread
[Caml-list] OCaml Speed for Block Convolutions
[
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: | -- (:) |
| From: | Chris Hecker <checker@d...> |
| Subject: | Re: [Caml-list] OCaml Speed for Block Convolutions |
>I think the constant creation of new arrays to hold intermediate results >(i.e., immutable data) is costing too much. Many of the intermediate values >could be overwritten in place and save a lot of time. >... of course... don't ask how long it took to write all this stuff in the >inner loops of the convolution in C, nor how long it took to debug that >stuff.... And immutable data definitely helps to get the code correct. OCaml >still rules! I think I'm missing something. The ocaml loops allocate memory for temps, but the C loops reuse storage? Did you do a version for ocaml that's got the same level of optimizations as the C version (not allocating, etc.)? If the code's not to big, could you post it? Chris ------------------- To unsubscribe, mail caml-list-request@inria.fr. Archives: http://caml.inria.fr