comp.lang.ada
 help / color / mirror / Atom feed
From: "Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de>
Subject: Re: Task_Barriers
Date: Fri, 26 Jul 2019 13:09:29 +0200
Date: 2019-07-26T13:09:29+02:00	[thread overview]
Message-ID: <qhen18$11ls$1@gioia.aioe.org> (raw)
In-Reply-To: f1aefde4-371a-49f5-9e7b-4e8b0bc807a2@googlegroups.com

On 2019-07-26 12:38, Gilbert Gosseyn wrote:

> Ada 2012 provides a language-de\ffined package to synchronously release a group of tasks after the number of blocked tasks reaches a specifi\fed count value.
[...]
> What may be wrong in my line of thinking?

It is not a mechanism suitable for 1-n publisher-subscriber or 
multi-cast services (you were talking about messaging). Think of various 
scenarios when some of consumer/producer tasks die or get blocked. 
Semaphore is a too low-level primitive and with k>1 has almost no 
practical use.

[See Ada protected objects]

Otherwise, your code works as expected.

-- 
Regards,
Dmitry A. Kazakov
http://www.dmitry-kazakov.de


  reply	other threads:[~2019-07-26 11:09 UTC|newest]

Thread overview: 12+ messages / expand[flat|nested]  mbox.gz  Atom feed  top
2019-07-25 16:32 Task_Barriers Gilbert Gosseyn
2019-07-25 16:43 ` Task_Barriers Dmitry A. Kazakov
2019-07-25 18:56 ` Task_Barriers Dennis Lee Bieber
2019-07-25 20:11   ` Task_Barriers Jeffrey R. Carter
2019-07-25 20:17 ` Task_Barriers Simon Wright
2019-07-25 21:59   ` Task_Barriers Randy Brukardt
2019-07-26  7:52     ` Task_Barriers Simon Wright
2019-07-26 23:59       ` Task_Barriers Dennis Lee Bieber
2019-07-26 10:38   ` Task_Barriers Gilbert Gosseyn
2019-07-26 11:09     ` Dmitry A. Kazakov [this message]
2019-07-26 15:03     ` Task_Barriers Simon Wright
2019-07-27  0:10     ` Task_Barriers Dennis Lee Bieber
replies disabled

This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox