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,22d1652a85f14a1e X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2003-02-27 15:17:05 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!news-spur1.maxwell.syr.edu!news.maxwell.syr.edu!news.airnews.net!cabal12.airnews.net!usenet From: "John R. Strohm" Newsgroups: comp.lang.ada Subject: Re: Speeding up Ada procedure? Date: Thu, 27 Feb 2003 16:57:22 -0600 Organization: Airnews.net! at Internet America Message-ID: <3522D5A11CF380F0.37E228C75C332073.7227DC2878F4EA61@lp.airnews.net> X-Orig-Message-ID: References: <1d13e1b4.0302261526.40058154@posting.google.com> <3E5E32A2.DA8DDA1C@raytheon.com> Abuse-Reports-To: abuse at airmail.net to report improper postings NNTP-Proxy-Relay: library1-aux.airnews.net NNTP-Posting-Time: Thu Feb 27 17:14:53 2003 NNTP-Posting-Host: !_*291k-X-L2`5Q (Encoded at Airnews!) X-Priority: 3 X-MSMail-Priority: Normal X-Newsreader: Microsoft Outlook Express 5.50.4522.1200 X-MimeOLE: Produced By Microsoft MimeOLE V5.50.4522.1200 Xref: archiver1.google.com comp.lang.ada:34691 Date: 2003-02-27T16:57:22-06:00 List-Id: "Mark Johnson" wrote in message news:3E5E32A2.DA8DDA1C@raytheon.com... > Hmm. Have you tried measuring the performance of the routines in > question? I have found that my "intuition" (and others) fails to find > the real problem area more often than not. An example of some code I had > to fix was a Jovial to Ada translator. The developer knew that symbol > lookup needed to be fast so did a pragma (Inline) to speed it up. When I > fed a large file (say 3000 lines) with a lot of symbols, the program ran > really slow (over two CPU days - never finished). A profile did not find > the problem until I removed that pragma (Inline) and then 99.999...% of > the CPU time was in that symbol lookup routine. > The lookup method was a linear search of an unsorted list! > We changed it to a hash table & the CPU time for that one file went to > less than 5 minutes. Just out of curiosity, where was this? GD/Fort Worth, by any chance?