Version française
Home     About     Download     Resources     Contact us    
Browse thread
Faking concurrency using Unix forks and pipes
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: Jon Harrop <jon@f...>
Subject: Re: [Caml-list] Faking concurrency using Unix forks and pipes
On Wednesday 30 May 2007 09:32:48 Loup Vaillant wrote:
> As far as I know, the developement team had made it quite clear that
> there will be no concurent GC (not in the near future, at least). The
> main reason is performance loss.

Might be interesting to compare the performance of some languages using my ray 
tracer:

C++: 3.67s
OCaml: 3.97s
F#: 5.26s
Lisp: 6.04s
Scheme: 6.29s
Java: 6.53s

F# is ~30% slower than OCaml but can be made almost twice as fast on my dual 
core machine by tracing concurrently. However, Java is also a concurrent 
static language and it is much slower. Maybe this reflects more effort having 
gone into the .NET GC.

I should also note that the F# and Scheme are both 32-bit. I wonder how well 
F# would do if it were 64-bit... :-)

-- 
Dr Jon D Harrop, Flying Frog Consultancy Ltd.
OCaml for Scientists
http://www.ffconsultancy.com/products/ocaml_for_scientists/?e