LISTSERV mailing list manager LISTSERV 16.0

Help for TEAM-ADA Archives


TEAM-ADA Archives

TEAM-ADA Archives


TEAM-ADA@LISTSERV.ACM.ORG


View:

Message:

[

First

|

Previous

|

Next

|

Last

]

By Topic:

[

First

|

Previous

|

Next

|

Last

]

By Author:

[

First

|

Previous

|

Next

|

Last

]

Font:

Proportional Font

LISTSERV Archives

LISTSERV Archives

TEAM-ADA Home

TEAM-ADA Home

TEAM-ADA  December 1998

TEAM-ADA December 1998

Subject:

Ada95 for Deep Space Missions .. can it compete?

From:

"Fowler, Kenneth" <[log in to unmask]>

Reply-To:

Fowler, Kenneth

Date:

Wed, 2 Dec 1998 11:06:05 -0500

Content-Type:

text/plain

Parts/Attachments:

Parts/Attachments

text/plain (142 lines)

Team members,
A friend and past colleague (Jim McKelvey, project scientist) at JPL finds
the new C++ templates to be an advantage over Ada generics (Ada83), but I
will
let him speak for himself. This topic overlaps Ada promotion and Ada
technology (Info Ada Usenet). Please comment as appropriate and cc. to
[log in to unmask]
--Ken Fowler, MITRE

        "C++ is a lot of fun, even though I would probably push Ada-95. The

> C++ "templates" are much more powerful than Ada generics, unless
> Ada-95 has beefed them up. (Are you familiar with the Blitz project?
> They use templates in a  radically new way. It  might be usable with
> Ada generics as well.)
>
      To describe template expressions (as in Blitz), let's make up a
      scenario. Suppose we want a class to do matrix operations, and we
      want it to use operator overloading. So we want to do:

                A = B + C + D;

        to add some 3x4 matrices.  What really happens is:

                Create and initialize a temporary (say X)
                Set it to the value of B + C
                Create and initialize a temporary (say Y)
                Set it to the value of X + D
                Assign the value of Y to A
                Destroy X and Y

        The overhead is horrendous, and it's difficult for an optimizer to
do
        much to help.

        We can recast it as procedure calls:

                add(B, C, X);
                add(X, D, A);

        which is faster. But we have lost our nice notation, and still need
a
        temporary.

        We could do:

                add(B, C, A);
                add(A, D, A);

        with a little more work.

        In Blitz, though, the matrix expression A = B + C + D
        would construct code to compute A = B + C + D as an
        expression. In other words, the generated code would
        look more like this:

        for (i = 0; i < 3; i++)
        {
           for (j = 0; j < 4; i++)
           {
                       A[i][j] = B[i][j] + C[i][j] + D[i][j];
           }
        }

        No temporaries - and the more complicated the expression, the
greater the speedup. In fact, we could even unroll the loops for a
greater speedup. The situation is readily understood by an optimizer.

        How does it do THAT you ask? By aggressively applying two
techniques:

        Recursive template instantiation (mostly implicitly)
        function Inlining


        In fact, C++ is moving in the direction of extensive use of
templates,      even in situations where they are not expected. The new
library is
        the Standard Template Library after all.

        The major down side to all this is that not one programmer in a
thousand will ever really understand how a package like Blitz works,    and
not one programmer in a million will ever undertake a project
        using template expressions.


        The real work at runtime is done in Blitz methods that are not
        normally inlined. So there is no great increase in memory.
        Here's a C++ example to try:

        #include <iostream.h>

        // Template
        template <const unsigned long int n>

        struct Factorial
        {
                static const unsigned long int factorial =
                        n * Factorial<n - 1>::factorial;
        };

        // Specialization of template
        struct Factorial<2>
        {
                static const unsigned long int factorial = 2;
        };

        // Specialization of template
        struct Factorial<1>
        {
                static const unsigned long int factorial = 1;
        };

        // Specialization of template
        struct Factorial<0>
        {
                static const unsigned long int factorial = 1;
        };

        int main(void)
        {
                cout << Factorial<6>::factorial << endl;

                return 1;
        }

        Compile this with full optimization and look at the generated code!
        Can this be translated into Ada95? The implicit instantiations can
        be made explicit -- the kicker is the specialization to end the
        recursion.

        Note that you cannot end the recursion (at least in C++) by
        changing the main expression to something like:

        (n > 1) ? (n * Factorial<n - 1>::factorial) : 1

        because the expression is not evaluated until after template
        expansion. Instead you'll bomb out by exceeding the template
        recursion depth."

                                                                --Jim

Top of Message | Previous Page | Permalink

Advanced Options


Options

Log In

Log In

Get Password

Get Password


Search Archives

Search Archives


Subscribe or Unsubscribe

Subscribe or Unsubscribe


Archives

December 2017
November 2017
October 2017
September 2017
June 2017
May 2017
April 2017
January 2017
December 2016
November 2016
October 2016
August 2016
July 2016
June 2016
May 2016
April 2016
March 2016
February 2016
January 2016
December 2015
November 2015
October 2015
September 2015
August 2015
June 2015
May 2015
April 2015
March 2015
February 2015
January 2015
December 2014
November 2014
September 2014
August 2014
July 2014
June 2014
May 2014
April 2014
March 2014
February 2014
January 2014
December 2013
November 2013
October 2013
September 2013
June 2013
May 2013
April 2013
March 2013
February 2013
January 2013
December 2012
November 2012
October 2012
September 2012
August 2012
July 2012
June 2012
May 2012
April 2012
February 2012
January 2012
December 2011
November 2011
October 2011
September 2011
August 2011
July 2011
June 2011
May 2011
April 2011
December 2010
November 2010
October 2010
September 2010
June 2010
May 2010
April 2010
March 2010
February 2010
January 2010
December 2009
November 2009
October 2009
September 2009
August 2009
July 2009
June 2009
May 2009
April 2009
February 2009
January 2009
December 2008
November 2008
October 2008
September 2008
August 2008
June 2008
May 2008
April 2008
March 2008
February 2008
January 2008
December 2007
November 2007
October 2007
September 2007
June 2007
May 2007
March 2007
February 2007
December 2006
November 2006
October 2006
September 2006
August 2006
July 2006
June 2006
May 2006
April 2006
March 2006
February 2006
January 2006
December 2005
November 2005
October 2005
August 2005
July 2005
June 2005
May 2005
April 2005
March 2005
February 2005
January 2005
December 2004
November 2004
October 2004
September 2004
August 2004
July 2004
June 2004
May 2004
March 2004
February 2004
January 2004
December 2003
November 2003
October 2003
September 2003
August 2003
July 2003
June 2003
May 2003
April 2003
March 2003
February 2003
January 2003
December 2002
November 2002
October 2002
September 2002
August 2002
July 2002
June 2002
May 2002
April 2002
March 2002
February 2002
December 2001
November 2001
October 2001
September 2001
August 2001
July 2001
June 2001
May 2001
April 2001
March 2001
February 2001
January 2001
December 2000
November 2000
October 2000
September 2000
August 2000
July 2000
June 2000
May 2000
April 2000
March 2000
February 2000
January 2000
December 1999
November 1999
October 1999
September 1999
August 1999
July 1999
June 1999
May 1999
April 1999
March 1999
February 1999
January 1999
December 1998
November 1998
October 1998
September 1998
August 1998
July 1998
June 1998
May 1998
April 1998
March 1998
February 1998
January 1998
December 1997
November 1997
October 1997
September 1997
August 1997
July 1997
June 1997
May 1997
April 1997
March 1997
February 1997
January 1997
December 1996
November 1996
October 1996

ATOM RSS1 RSS2



LISTSERV.ACM.ORG

Secured by F-Secure Anti-Virus CataList Email List Search Powered by the LISTSERV Email List Manager