From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00 autolearn=ham autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,90c3c79963d78580 X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2001-05-09 23:48:29 PST Path: newsfeed.google.com!newsfeed.stanford.edu!headwall.stanford.edu!news-out.nibble.net!hub1.nntpserver.com!cyclone-sjo1.usenetserver.com!news-out-sjo.usenetserver.com!e420r-sjo4.usenetserver.com!news-out.usenetserver.com!newshub2.rdc1.sfba.home.com!news.home.com!news1.rdc1.sfba.home.com.POSTED!not-for-mail From: tmoran@acm.org Newsgroups: comp.lang.ada Subject: Re: Numerical Computation and Ada95 References: <9dd9tb$1o56$1@ulysses.noc.ntua.gr> X-Newsreader: Tom's custom newsreader Message-ID: <0RqK6.1537$%i7.1382275@news1.rdc1.sfba.home.com> Date: Thu, 10 May 2001 06:48:28 GMT NNTP-Posting-Host: 24.20.190.201 X-Complaints-To: abuse@home.net X-Trace: news1.rdc1.sfba.home.com 989477308 24.20.190.201 (Wed, 09 May 2001 23:48:28 PDT) NNTP-Posting-Date: Wed, 09 May 2001 23:48:28 PDT Organization: Excite@Home - The Leader in Broadband http://home.com/faster Xref: newsfeed.google.com comp.lang.ada:7434 Date: 2001-05-10T06:48:28+00:00 List-Id: >>From what you said I undestand that nobody has ever compared Ada's timing >performance with Fortran77/90/95, C and C++ in programs that require lots >of arithmetic and logical operations (perhaps FFT). I think I will try to >do it when I learn Ada95 better There was a substantial comparison someplace (perhaps Ada Letters?) some time ago, but I don't remember just when. Try looking in www.adapower.com, www.adahome.com, or www.adaic.org A simple minded transliteration from one language to another can have pitfalls, accessing arrays in row-major vs column-major order being an example. When I went to translate an algorithm from "Numerical Recipes in Fortran" it became obvious during the translation to Ada that the Fortran version was doing some extra, wasted, iterations. Do you want to compare the Fortran version against an exact translation that includes those wasted cycles, or against an Ada version that preserves the algorithm, but not the poor coding? It's not always obvious what's the appropriate comparison.