Browse thread
Is OCaml fast?
-
Thanassis Tsiodras
- Gregory Bellier
- Sylvain Le Gall
- Dario Teixeira
- Gerd Stolpmann
- Fabrice Le Fessant
- Oliver Bandel
- Isaac Gouy
- David Allsopp
- Cedric Cellier
- Vincent Aravantinos
- Isaac Gouy
[
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: | 2010-11-23 (10:37) |
From: | Christophe TROESTLER <Christophe.Troestler+ocaml@u...> |
Subject: | Re: [Caml-list] Re: Is OCaml fast? |
On Tue, 23 Nov 2010 02:03:48 +0000, Isaac Gouy wrote: > > > C version : 12.11 secs > > OCaml version : 47.22 secs > > OCaml version with GC parameters tuned ("interesting alternative" > section) : 12.67 secs > > And of course you know because that GC tuned OCaml program is shown > on the > benchmarks game website ;-) > http://shootout.alioth.debian.org/u32/program.php?test=binarytrees& > lang=ocaml&id=1 Since you are here, please explain why C can use memory pools and vec tor instructions but tuning the GC of OCaml $B!=(B although it is part of the standard library $B!=(B is considered an $B!H(Balternative$B!I(B. Best, C.