Browse thread
Odd performance result with HLVM
[
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: | 2009-03-02 (03:14) |
From: | Jon Harrop <jon@f...> |
Subject: | Re: [Caml-list] Odd performance result with HLVM |
On Saturday 28 February 2009 21:52:18 Jon Harrop wrote: > However, a simple benchmark that creates and folds over a huge list > actually runs faster on my HLVM than it does in OCaml. I just finished implementing a list-based solution to the n-queens problem and that does run 5-14x faster in OCaml than on my HLVM: n=8 OCaml: 0.012s HLVM: 0.190s n=9 OCaml: 0.088s HLVM: 0.591s n=10 OCaml: 0.740s HLVM: 3.713s n=11 OCaml: 6.68s HLVM: Out of memory HLVM ran out of memory in the last case because I have not yet reintegrated the GC. -- Dr Jon Harrop, Flying Frog Consultancy Ltd. http://www.ffconsultancy.com/?e