Linked by Thom Holwerda on Wed 4th Jun 2008 09:14 UTC, submitted by fairynomo
Permalink for comment 317457
To read all comments associated with this story, please click here.
To read all comments associated with this story, please click here.
News
Linked by Thom Holwerda on 05/22/13 22:23 UTC
Linked by Thom Holwerda on 05/22/13 13:38 UTC
Linked by Thom Holwerda on 05/22/13 13:30 UTC, submitted by JRepin
Linked by Thom Holwerda on 05/21/13 22:06 UTC
Linked by Thom Holwerda on 05/21/13 21:45 UTC
Linked by Thom Holwerda on 05/21/13 15:53 UTC
Linked by Thom Holwerda on 05/20/13 22:43 UTC
Linked by Thom Holwerda on 05/20/13 21:50 UTC
Linked by Thom Holwerda on 05/19/13 23:15 UTC
Linked by Thom Holwerda on 05/19/13 23:11 UTC, submitted by Drumhellar
More News »
Sponsored Links



Member since:
2008-04-08
A couple of years ago I profiled the GreenHills Ada95/C-C++ compiler. When you turn off run-time checking in Ada (esentually making it generate C/C++ like machine code) the performance difference was only ~3-4% (PPC 603e/vxWorks) overall and in some code the Ada was actually faster (Array manipulation). The benefit of Ada with RT checking off is that you still get all the compile-time checks that you don't get with C/C++.
There are very good compilers on the market these days, they are not cheep (except for gnat).
The issue with Ada compilers is that the compiler must do a lot more work on the source then most other compilers so they are much more difficult to write. Once that is done however, certain aspects of optimizing become much easier due to the checking that is done during compiling that is then not needed during run-time.
It is well known that the earlier you catch a bug in the application the cheaper it is to fix.
By having a strong compiler/language, most semantic based bugs are eliminated at compile time. The strong typing helps with some logic bugs. These are things that Ada is very good at.
Krreagan