It's not surprising that the performance of JDK 6 has improved significantly
as they have introduced escape analysis where the JVM can convert heap
allocations to stack allocation where possible.
Sanjiv
On 10/13/07, Allan Ang <[EMAIL PROTECTED]> wrote:
>
>
> true.
>
> but the implementation for a
true.
but the implementation for a bubblesort is relatively simple and the c++ and
java code match each other very very closely (i.e 2 simple for loops and a
swap). Let me know if you want the codes that i used. Naturally we only
started the timing when after the arrays were initialized.
I was a
I recall a performance challenge on a project I was on in the mid-1990s.
It's not just the language, but how well you can implement a solution (your
skills have everything to do with this).
We were implementing a middle-tier Tuxedo data cache between the desktop and
the host. The one implemented
ran BEA 1.6, time taken=31 s
ran Sun 1.6, time taken=5 s
both with -server flags.
:)
--
View this message in context:
http://www.nabble.com/Sun-java-JDK-1.6-performance-tf4611665s2369.html#a13186279
Sent from the AppFuse - User mailing list archive at Nabble.com.
Try BEA 1.6 ;)
Allan Ang wrote:
>
> Hi all,
>
> Just thought that I would post about a performance benchmark that I made
> with some colleagues at work. We wanted to test whether java could beat
> c++ in performance, so we implemented a bubblesort in both java and c++.
>
> When I used the BEA
Hi all,
Just thought that I would post about a performance benchmark that I made
with some colleagues at work. We wanted to test whether java could beat c++
in performance, so we implemented a bubblesort in both java and c++.
When I used the BEA 1.5 SDK, the c++ code was approximately twice as f
