Ada->C++ conversion stats?

Ada->C++ conversion stats?

[tmoran]

Every once in a while we hear of something in Ada (presumably Ada 83)
being rewritten in C++.  When that happens, is there a complete
redesign, or just a transliteration?  If the former, how much effort
is the rewrite as compared to the original (I realize the second
time around is easier) and how does the result compare?  If a
transliteration, how much effort, how many old bugs discovered
and how much debugging time for new bugs and how does the result
compare to the original.  If no comparison is available, is it
because there's no record of the original or because there's no
measurement of the new version, or what?

Re: Ada->C++ conversion stats?

[Robert L. Klungle]

tmoran@bix.com wrote:

> Every once in a while we hear of something in Ada (presumably Ada 83)
> being rewritten in C++.  When that happens, is there a complete
> redesign, or just a transliteration?  If the former, how much effort
> is the rewrite as compared to the original (I realize the second
> time around is easier) and how does the result compare?  If a
> transliteration, how much effort, how many old bugs discovered
> and how much debugging time for new bugs and how does the result
> compare to the original.  If no comparison is available, is it
> because there's no record of the original or because there's no
> measurement of the new version, or what?

I can report on the conversion of an image tracker (MHT) from Ada83 to
C++ (just finishing).
Total time so far is 3.5 months to translate.
If I had to do it over again, I wouldn't. The rigors of the Ada syntax
make the looseness of C/C++ stand out.
The C++ version execution time is 3 times slower than the original Ada.
Primarily due to the implementation of an Array (Matrix) class as a
Class of Vectors-of-Vectors.
This was done to keep the matrix type of referencing ([][]). There is no
C++ operator to overload of this kind.
This is not the only contributor to execution time increases.
The resulting code is clumsy compared to the original Ada.
All kinds of optimizations were/are being done to keep the speed up, but
the above is the best we have been able to do so far.
It works just like the original, but slower.

cheers...bob

Re: Ada->C++ conversion stats?

[Robert Dewar]

In article <38D722C1.8B6C58F7@gte.net>,
  "Robert L. Klungle" <bklungle@gte.net> wrote:
> All kinds of optimizations were/are being done to keep the
speed up, but
> the above is the best we have been able to do so far.
> It works just like the original, but slower.

One has to wonder whose money was spent in this useless
excercise :-)


Sent via Deja.com http://www.deja.com/
Before you buy.

Re: Ada->C++ conversion stats?

[Hyman Rosen]

"Robert L. Klungle" <bklungle@gte.net> writes:
> The C++ version execution time is 3 times slower than the original Ada.
> Primarily due to the implementation of an Array (Matrix) class as a
> Class of Vectors-of-Vectors.
> This was done to keep the matrix type of referencing ([][]). There is no
> C++ operator to overload of this kind.

You should certainly not implement (non-sparse) matrices as vectors
of vectors! I would advise you to get a copy of Barton & Nackman's
"Scientific and Engineering C++". There are all sorts of efficient
algorithms in there for implementing matrices while preserving the
[][] C++ array referencing syntax.

Re: Ada->C++ conversion stats?

[Hyman Rosen]

"Robert L. Klungle" <bklungle@gte.net> writes:
> The C++ version execution time is 3 times slower than the original Ada.
> Primarily due to the implementation of an Array (Matrix) class as a
> Class of Vectors-of-Vectors.
> This was done to keep the matrix type of referencing ([][]). There is no
> C++ operator to overload of this kind.

In addition to the B&N book, you should also look at the Blitz++ library.
It uses the expression template technique to convert concisely written
matrix operations into the equivalent of hand-optimized loops. It's free.
See <http://oonumerics.org/blitz/index.html>.

Re: Ada->C++ conversion stats?

[Gerald Kasner]

Hyman Rosen wrote:
> 
> "Robert L. Klungle" <bklungle@gte.net> writes:
> > The C++ version execution time is 3 times slower than the original Ada.
> > Primarily due to the implementation of an Array (Matrix) class as a
> > Class of Vectors-of-Vectors.
> > This was done to keep the matrix type of referencing ([][]). There is no
> > C++ operator to overload of this kind.
> 
> In addition to the B&N book, you should also look at the Blitz++ library.
> It uses the expression template technique to convert concisely written
> matrix operations into the equivalent of hand-optimized loops. It's free.
> See <http://oonumerics.org/blitz/index.html>.

Rather than using blitz or something like that, I would prefer libblas,
which 
is highly tuned and available for various platforms. C bindings should
be available 
at netlib.org.
If the matrix operations are responsible for the slowness, the use of
blas would 
give incredible speedups, even in the Ada version.

-Gerald