comp.lang.ada
 help / color / mirror / Atom feed
From: Ole-Hjalmar Kristensen <ole-hjalmar.kristensen@substitute_employer_here.com>
Subject: Re: 'Base
Date: 12 Dec 2005 10:14:38 +0100
Date: 2005-12-12T09:19:30+00:00	[thread overview]
Message-ID: <wvbrwtia65j5.fsf@sun.com> (raw)
In-Reply-To: 1170126.PvJVGQkA4J@linux1.krischik.com

My gut reaction was also that Ada will always outperform Java, but I
have found at least one case there this is not true.  I recently wrote
a simple test program to transpose a two-dimensional array in Java,
Ada, C++, and C. The purpose was not really to compare languages, but
to see the effects of caching. There were two different alogrithms
used, one a simple nested loop, the other a recursive subdivision with
a nested loop at the lowest level. When the simple nested loop was
tested with large data sets (~ available RAM on the machines) the
diffence between Ada, C, and C++ was insignificant, all being 3-4
times faster than Java. However, when testing the recursive version, I
found that Java was actually about 10% faster than the other three,
which again came extremely close to each other. Apparently the JIT
compiler had plenty of time to do its work and come up with pretty
optimal code. The other interesting result from the experiment was
that the recursive  version was from 3-4 to 20 times faster than the
simple nested loop.


>>>>> "MK" == Martin Krischik <krischik@users.sourceforge.net> writes:
<snip>
    MK> Ada arrays are not a primitive type - they are a quite complex and powerfull
    MK> type.

    MK> Performace? Ada allways outperform Java for a start. But Ada's build in
    MK> checks will also outperform C/C++ when used with all appropriate
    MK> "assert()"s in place.

<snip>
-- 
   C++: The power, elegance and simplicity of a hand grenade.



  parent reply	other threads:[~2005-12-12  9:14 UTC|newest]

Thread overview: 33+ messages / expand[flat|nested]  mbox.gz  Atom feed  top
2005-12-08 15:21 'Base ada_student
2005-12-08 18:08 ` 'Base Matthew Heaney
2005-12-08 18:44   ` 'Base Martin Dowie
2005-12-08 18:49     ` 'Base Martin Dowie
2005-12-08 19:24     ` 'Base Matthew Heaney
2005-12-08 20:27       ` 'Base Martin Dowie
2005-12-08 19:51     ` 'Base Jeffrey R. Carter
2005-12-08 20:07       ` 'Base Matthew Heaney
2005-12-09  2:57         ` 'Base Randy Brukardt
2005-12-09  2:13   ` Avoiding constraint checks w/ 'Base Anonymous Coward
2005-12-09  3:11     ` Randy Brukardt
2005-12-09 13:11   ` 'Base krischik
2005-12-09 13:52     ` 'Base Matthew Heaney
2005-12-09 20:42       ` 'Base Randy Brukardt
2005-12-08 19:11 ` 'Base Martin Krischik
2005-12-09 20:42   ` 'Base ada_student
2005-12-09 21:39     ` 'Base Pascal Obry
2005-12-10  3:30     ` 'Base Matthew Heaney
2005-12-10 14:50       ` 'Base ada_student
2005-12-10  7:52     ` 'Base Martin Krischik
2005-12-10 12:55       ` 'Base Larry Kilgallen
2005-12-10 13:37         ` 'Base Björn Persson
2005-12-11 11:00           ` 'Base Martin Krischik
2005-12-10 15:01         ` 'Base Robert A Duff
2005-12-11 10:59         ` 'Base Martin Krischik
2005-12-12  9:14       ` Ole-Hjalmar Kristensen [this message]
2005-12-12 19:08         ` 'Base Martin Krischik
2005-12-13 19:24           ` 'Base tmoran
2005-12-13 21:00         ` 'Base Georg Bauhaus
2005-12-14 19:43         ` 'Base Per Sandberg
2005-12-15 20:08           ` 'Base Martin Krischik
2005-12-16 19:19             ` 'Base Jeffrey R. Carter
2005-12-17  7:52               ` 'Base Martin Krischik
replies disabled

This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox