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-28 (18:17) |
From: | oliver@f... |
Subject: | Re: [Caml-list] Re: Is OCaml fast? |
On Sat, Nov 27, 2010 at 04:58:55PM +0100, Christophe Raffalli wrote: > Hello, > > To the extent that this rule is the same for all languages and that most > > languages on the shootout are also garbage collected, I think OCaml's > > problem with this benchmark do point at a weakness of the current > > GC code. > This is untrue ... the bintree example, is just bad in OCaml because the > default > value of the minor heap size is the correct value for reactive programs > where you want fast minor GC slice, because they interrupt the program ... [...] And if your program contains both kinds of functionality? What possible solution would you recommend? Ciao, Oliver