Version française
Home     About     Download     Resources     Contact us    
Browse thread
Comparison of OCaml and MLton for numerics
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: Julien Signoles <signoles@l...>
Subject: Re: [Caml-list] Comparison of OCaml and MLton for numerics

>> However, in some cases, defunctorization may produce a good speedup,
>> especially if you use massive inlining (e.g. ocamlopt -inline 1000). On the
>> contrary, defunctorization may produce cache problem because the size of 
>> the
>> defunctorized code may be very bigger than the size of the initial code.
>
> I've never observed this problem in practice using MLton, and don't know 
> anyone
> in the MLton world who has.  Has this actually been observed using the OCaml
> defunctorizer?

Indeed, I don't observe such a problem in practice but I guess it is 
possible because the size of the defunctorized code may be up to 20x 
(maybe more) the size of the initial code (observed in practice). Just 
combine this with massive inlining on very-big massively-functorized 
application...

Of course, MLton is much more used than ocamldefun. So I hope you're right.

Julien
-- 
mailto:Julien.Signoles@lri.fr ; http://www.lri.fr/~signoles
"In theory, practice and theory are the same,
but in practice they are different" (Larry McVoy)