From: Gerd Stolpmann <Gerd.Stolpmann@darmstadt.netsurf.de>
To: caml-list@inria.fr
Subject: Re: speed versus C
Date: Tue, 5 Oct 1999 22:20:59 +0200
Message-Id: <99100522193302.17263@ice>
On Sun, 03 Oct 1999, Jan Brosius wrote:
>Hi, is there anything known about the efficiency of compiled Ocaml code
>compared with C/C++
A good comparision of the low-level features of Ocaml and C are my
implementations of the cryptographic algorithms Blowfish and DES. Such
algorithms do many integer calculations, bit shifting, and array lookups, i.e.
tasks where C is perfect, and Ocaml is not designed for. The manually optimized
algorithms are 8 to 10 times slower than the C counterparts, and a factor of 2
can be explained with Ocaml's problems when computing with 32 bit numbers. To
get around this, all 32 bit calculations are simulated by doing them on two 16
bit halves. If such problems do not play a role, Ocaml is at most 4 to 5 times
slower than C.
As already pointed out, Ocaml is not designed for such problems, and this
slow-down factor is an upper limit. The typical application will have a speed
which is comparable with C/C++ solutions, as there are a number of advantages:
- The recursive data types of Ocaml are often more problem-oriented than
"imperative" data structures. Consider you want to fill an (C) array with an
unknown number of elements. The typical solution puts the elements into the
array until it is full, and then enlarges the array by reallocating new
memory. If you use the Ocaml lists instead, you do not have this problem. Of
course, you can program linked lists in C, too, but they are not as
convenient as arrays are, so many people avoid them. I think this is a very
common problem in C where algorithms on static structures are cheap, and
algorithms working with dynamic structures are either complicated (but fast),
or calculate the same several times (but are simple to understand), or use
sophisticated but heavy-weight libraries (with a complex interface). This is
a bad alternative. Considering all of simplicity, time and space comsumption,
I would say that Ocaml scales better.
- OCaml code expresses the same with fewer lines of code, so it is possible to
write more complicated solutions, and to prefer a more sophisticated approach
over the straight-forward solution.
- Memory management is much better; but this counts only for long-running
applications. Many C/C++ programs only "malloc" and do not "free", so the
time consumption of these functions isn't a problem.
Gerd
-- ---------------------------------------------------------------------------- Gerd Stolpmann Telefon: +49 6151 997705 (privat) Viktoriastr. 100 64293 Darmstadt EMail: Gerd.Stolpmann@darmstadt.netsurf.de (privat) Germany ----------------------------------------------------------------------------
This archive was generated by hypermail 2b29 : Sun Jan 02 2000 - 11:58:26 MET