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-Language: ENGLISH,ASCII-7-bit
Path: 
 g2news2.google.com!news4.google.com!feeder1-2.proxad.net!proxad.net!feeder2-2.proxad.net!newsfeed.arcor.de!newsspool4.arcor-online.net!news.arcor.de.POSTED!not-for-mail
Date: Tue, 11 Aug 2009 23:38:43 +0200
From: Georg Bauhaus <see.reply.to@maps.futureapps.de>
Reply-To: rm.tsoh-bauhaus@maps.futureapps.de
User-Agent: Thunderbird 2.0.0.22 (X11/20090608)
MIME-Version: 1.0
Newsgroups: comp.lang.ada
Subject: Re: GNAT's stack checking in Ubuntu 9.04 (and Shootout regex-dna)
References: <4a776a94$0$31878$9b4e6d93@newsspool3.arcor-online.net>
 	<u18g75108pv06pegc2sk971n97fd11gfjk@4ax.com>
 <4a7f1fc5$0$31344$9b4e6d93@newsspool4.arcor-online.net>
 	<9adb4985-582c-4cbf-906c-3afa7dcd31f6@g1g2000vbr.googlegroups.com>
 	<4a80ae6e$0$31877$9b4e6d93@newsspool3.arcor-online.net>
 <4564d943-9a6a-4112-9ae2-f379b8654669@18g2000yqa.googlegroups.com>
In-Reply-To: 
 <4564d943-9a6a-4112-9ae2-f379b8654669@18g2000yqa.googlegroups.com>
Content-Type: text/plain; charset=ISO-8859-1
Content-Transfer-Encoding: 7bit
Message-ID: <4a81e4e4$0$31327$9b4e6d93@newsspool4.arcor-online.net>
Organization: Arcor
NNTP-Posting-Date: 11 Aug 2009 23:38:44 CEST
NNTP-Posting-Host: 36e86837.newsspool4.arcor-online.net
X-Trace: 
 DXC=_hKVTiC>nb=_A0jCfgHO6>4IUK<Cl32<14Fo<]lROoR1^YC2XCjHcb9Q`EOb8<<E71KQDKiQ7h<g>Vn`5agSM;;>ha5Pnik16T9
X-Complaints-To: usenet-abuse@arcor.de
Xref: g2news2.google.com comp.lang.ada:7684
Date: 2009-08-11T23:38:44+02:00
List-Id: <comp.lang.ada>

jonathan wrote:
>  In fact all settings of Max_CPUs
> from 9 to 15 ran in  9 seconds. At Max_CPUs = 24
> it was 9.7 sec.

Thanks, Jonathan, for these comments.
Your findings make me think that 9 is "magical"
because there are 9 patterns:  The algorithm is
such that it would try to arrange for 9 rendezvous
if there are 9 or more task objects available.
If this turns out to be true, I can simplify the
algorithm, getting rid of a clumsy loop that
distributes work to Max_CPUs task objects.