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=-0.3 required=5.0 tests=BAYES_00, REPLYTO_WITHOUT_TO_CC autolearn=no autolearn_force=no version=3.4.4 X-Google-Thread: a07f3367d7,3a6a9f1d654285ba,start X-Google-Attributes: gida07f3367d7,public,usenet X-Google-NewGroupId: yes X-Google-Language: ENGLISH,ASCII-7-bit Path: g2news2.google.com!news4.google.com!feeder.news-service.com!news.netcologne.de!newsfeed-fusi2.netcologne.de!newsfeed.straub-nv.de!noris.net!newsfeed.arcor.de!newsspool1.arcor-online.net!news.arcor.de.POSTED!not-for-mail Date: Sat, 01 Aug 2009 14:21:21 +0200 From: Georg Bauhaus Reply-To: rm.tsoh+bauhaus@maps.futureapps.de User-Agent: Thunderbird 2.0.0.22 (Windows/20090605) MIME-Version: 1.0 Newsgroups: comp.lang.ada Subject: Ada Shootout program for K-Nucleotide (patches) Content-Type: text/plain; charset=ISO-8859-1 Content-Transfer-Encoding: 7bit Message-ID: <4a743343$0$32674$9b4e6d93@newsspool2.arcor-online.net> Organization: Arcor NNTP-Posting-Date: 01 Aug 2009 14:21:23 CEST NNTP-Posting-Host: 297d8a0c.newsspool2.arcor-online.net X-Trace: DXC=k@IC9k7S>caj5k5aEF7ISmA9EHlD;3Ycb4Fo<]lROoRa^YC2XCjHcbi3\UQddR_@TlA:ho7QcPOVck`=XbXafo[ah?Z_T=J1b7o X-Complaints-To: usenet-abuse@arcor.de Xref: g2news2.google.com comp.lang.ada:7500 Date: 2009-08-01T14:21:23+02:00 List-Id: This is about the K-Nucleotide program at the Computer Language Benchmark Game, http://shootout.alioth.debian.org/u32/benchmark.php?test=knucleotide&lang=gnat&id=1 where some Ada programs have started to fail. In order to have one of them work again, I have patched knucleotide.gnat, with some success. New version is here: http://home.arcor.de/bauhaus/Ada/knucleotide.gnat Comments? Does it work on your machine? The two changes: 1 - [stack exhaustion] a loop reading input lines into an ubounded string replaces the recursive String "&"ing procedure. (Noting that the input text file is ~240MB ...) 2 - [heavy bounded strings] a lightweight bounded string ADT replaces an instance of Generic_Bounded_Length, yielding an improved running time of ~22s down from ~30s for the 2,500,000 case. Still, on a relatively small virtual machine running 64bit Debian, the program cannot handle the 25,000,000 case.