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=unavailable autolearn_force=no version=3.4.4
Path: 
 border1.nntp.dca3.giganews.com!backlog3.nntp.dca3.giganews.com!border3.nntp.dca.giganews.com!border1.nntp.dca.giganews.com!nntp.giganews.com!goblin2!goblin.stu.neva.ru!feeder.erje.net!eu.feeder.erje.net!newsfeed.datemas.de!uucp.gnuu.de!newsfeed.arcor.de!newsspool3.arcor-online.net!news.arcor.de.POSTED!not-for-mail
Date: Mon, 17 Feb 2014 13:18:03 +0100
From: "G.B." <rm-dash-bau-haus@dash.futureapps.de>
User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.9;
 rv:24.0) Gecko/20100101 Thunderbird/24.3.0
MIME-Version: 1.0
Newsgroups: comp.lang.ada
Subject: Re: Implementation Locks
References: <a6f65ae0-faf4-45eb-8a9c-f080fde3d58d@googlegroups.com>
In-Reply-To: <a6f65ae0-faf4-45eb-8a9c-f080fde3d58d@googlegroups.com>
Content-Type: text/plain; charset=ISO-8859-1; format=flowed
Content-Transfer-Encoding: 7bit
Message-ID: <5301fdfb$0$6668$9b4e6d93@newsspool2.arcor-online.net>
Organization: Arcor
NNTP-Posting-Date: 17 Feb 2014 13:18:03 CET
NNTP-Posting-Host: ff904e83.newsspool2.arcor-online.net
X-Trace: DXC=LF__FXBDT=mj5k5aEF7ISmA9EHlD;
 3Ycb4Fo<]lROoRa8kF<OcfhCOkUjnT\:2f@^mnc\616M64>jLh>_cHTX3jmn; HXLdi0G0`
X-Complaints-To: usenet-abuse@arcor.de
X-Original-Bytes: 2079
Xref: number.nntp.dca.giganews.com comp.lang.ada:184929
Date: 2014-02-17T13:18:03+01:00
List-Id: <comp.lang.ada>

On 15.02.14 21:20, sbelmont700@gmail.com wrote:
> Is it unreasonable to expect an implementation to use some sort of dynamic, hybrid model that takes into account both how many CPU's are in the system and the average time to wait?  Should I just trust the runtime and try not to worry?  Is there even anything I can do about it either way?

Other than proving that the situation cannot arise? 8-)

With many cores available, you could have one surveyor task
that awakes every second or so, for looking at volatile
Booleans that are global enough to be known to the other
tasks, one for each task: the other tasks would "ping"
their respective variables no later than a known good number
of microseconds, thus setting their Booleans to true.
The surveyor task clears them, and takes corresponding action
if one of the variable is false.

A task of this sort would only need the Ada features
available under profile Ravenscar, I think.