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-Thread: 103376,5ff6e0c3de8331c0 X-Google-Attributes: gid103376,public,usenet X-Google-Language: ENGLISH,ASCII-7-bit Path: g2news1.google.com!news1.google.com!border1.nntp.dca.giganews.com!nntp.giganews.com!local01.nntp.dca.giganews.com!nntp.comcast.com!news.comcast.com.POSTED!not-for-mail NNTP-Posting-Date: Wed, 04 Jul 2007 20:45:14 -0500 From: tmoran@acm.org Newsgroups: comp.lang.ada Subject: Re: sub-optimal code for packed boolean arrays -- bug or inherent limitation References: <468BF21C.7040708@obry.net> X-Newsreader: Tom's custom newsreader Message-ID: Date: Wed, 04 Jul 2007 20:45:14 -0500 X-Usenet-Provider: http://www.giganews.com NNTP-Posting-Host: 24.6.140.189 X-Trace: sv3-uh0SbJMxpLm7tAoaTRUrTWbm1Zw8zRqt0QjZxmxLV+Sg9eFYoTmdX07ECJOYd2IdCA0bVub+aItUIk5!ZMKq4U/hQaWNId3qnHL3tw6A/Vw7rEp5bgmxVtJddkhrfdd69yQPdtILdeJLcTmCWLldVqZu8ef4!CNkNR5kn5scILJzNa0hIow3QSFGC X-Complaints-To: abuse@comcast.net X-DMCA-Complaints-To: dmca@comcast.net X-Abuse-and-DMCA-Info: Please be sure to forward a copy of ALL headers X-Abuse-and-DMCA-Info: Otherwise we will be unable to process your complaint properly X-Postfilter: 1.3.35 Xref: g2news1.google.com comp.lang.ada:16415 Date: 2007-07-04T20:45:14-05:00 List-Id: > That's not a proper timing. 3.15p is using a very old backend (2.x if my > memory is good). Since then there have been two major versions of the > GCC backend, both bringing better optimizations. It would be better to > do the measurement with GCC/FSF 4.2 or GNAT GPL 2007. Gnat 3.15p was handy. Please post your results on timing the different codes with a different Ada compiler. Since my machine does have two cores, I tried it with a second task running the benchmark subroutine, ie two copies of the benchmark were running simultaneously. Elapsed time till they were both done was only 20% longer than running a single copy. So it might be worth looking into a multi-tasking design of the chess program.