Oliver_FF
New Member
- Joined
- Oct 15, 2006
- Messages
- 544 (0.08/day)
| Processor | Intel q9400 @ stock |
|---|---|
| Motherboard | Lanparty P45-T2RS |
| Cooling | Zalman CNPS-9500 |
| Memory | 8GB OCZ PC2-6400 |
| Video Card(s) | BFG Nvidia GTX285 OC |
| Storage | 1TB, 500GB, 500GB |
| Display(s) | 20" Samsung T200HD |
| Case | Antec Mini P180 |
| Audio Device(s) | Sound Blaster X-Fi Elite Pro |
| Power Supply | 700w Hiper |
| Software | Ubuntu x64 virtualising Vista |
So when someone is talking about Java what pops into your head?
Here's what I think people think of:
1. interpreted language
2. everyone knows interpreted languages are slow
3. mobile phone games
- can't be *that* powerful a language
And yes, interpretation is pretty slow. But Java is not slow.
Suppose someone is writing some code in C that involves a simple loop (say 1M iterations) and some If statements. Nice and simple, first time go at solving a problem, not very well optimized - seeing if it works. The C compiler has some optimizations it can perform at compile time, and these are turned on - so the resulting .exe has been optimized to a certain level, removing the obviously redundant operations that aren't needed, etc.
Now suppose the exact same code is used in Java. It is compiled to java byte code and ready to run in the JVM (java virtual machine). At run time, the JVM loads the class, interprets the code (slooooow) and starts running the loop. After the initial interpretation the JVM will compile the byte code down to machine code, which will be rather similar to the output of the C compiler. After the first say 10,000 iterations of this loop, things get interesting. The JVM will take a look at the original byte code (which is close in comparison to the original Java code) and examine it and refactor parts. It won't just remove redundant operations like the C compiler, it will actually change the code layout to improve performance. This is only possible because the original byte code is present for reference. This extra stage of compilation is called "Just In Time" compilation, or JIT.
So the result? The C program will run with constant speed all the way through. The Java program will start off slow, then pull up with the speed of the C program, then it will overtake if for the long run to the finish. Obviously the speed difference depends on how good/bad the initial code is - if the C code is already heavily optimized by the coder then the performance of the C will be better. For a general quick throw-it-together bit of programming though Java can outperform C.
Wiki for further reading:
http://en.wikipedia.org/wiki/Just-in-time_compilation
http://en.wikipedia.org/wiki/HotSpot
Oh, and for the record I think the Java API's are pretty awesome
http://java.sun.com/j2se/1.5.0/docs/api/
Here's what I think people think of:
1. interpreted language
2. everyone knows interpreted languages are slow
3. mobile phone games
- can't be *that* powerful a languageAnd yes, interpretation is pretty slow. But Java is not slow.
Suppose someone is writing some code in C that involves a simple loop (say 1M iterations) and some If statements. Nice and simple, first time go at solving a problem, not very well optimized - seeing if it works. The C compiler has some optimizations it can perform at compile time, and these are turned on - so the resulting .exe has been optimized to a certain level, removing the obviously redundant operations that aren't needed, etc.
Now suppose the exact same code is used in Java. It is compiled to java byte code and ready to run in the JVM (java virtual machine). At run time, the JVM loads the class, interprets the code (slooooow) and starts running the loop. After the initial interpretation the JVM will compile the byte code down to machine code, which will be rather similar to the output of the C compiler. After the first say 10,000 iterations of this loop, things get interesting. The JVM will take a look at the original byte code (which is close in comparison to the original Java code) and examine it and refactor parts. It won't just remove redundant operations like the C compiler, it will actually change the code layout to improve performance. This is only possible because the original byte code is present for reference. This extra stage of compilation is called "Just In Time" compilation, or JIT.
So the result? The C program will run with constant speed all the way through. The Java program will start off slow, then pull up with the speed of the C program, then it will overtake if for the long run to the finish. Obviously the speed difference depends on how good/bad the initial code is - if the C code is already heavily optimized by the coder then the performance of the C will be better. For a general quick throw-it-together bit of programming though Java can outperform C.
Wiki for further reading:
http://en.wikipedia.org/wiki/Just-in-time_compilation
http://en.wikipedia.org/wiki/HotSpot
Oh, and for the record I think the Java API's are pretty awesome
http://java.sun.com/j2se/1.5.0/docs/api/