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,FREEMAIL_FROM
	autolearn=unavailable autolearn_force=no version=3.4.4
X-Received: by 2002:a6b:6215:: with SMTP id f21mr18546iog.21.1553596925031;
        Tue, 26 Mar 2019 03:42:05 -0700 (PDT)
X-Received: by 2002:a9d:3289:: with SMTP id u9mr11644332otb.52.1553596924876;
 Tue, 26 Mar 2019 03:42:04 -0700 (PDT)
Path: 
 eternal-september.org!reader01.eternal-september.org!feeder.eternal-september.org!weretis.net!feeder6.news.weretis.net!feeder.usenetexpress.com!feeder-in1.iad1.usenetexpress.com!border1.nntp.dca1.giganews.com!nntp.giganews.com!78no169569itl.0!news-out.google.com!r82ni129ita.0!nntp.google.com!w126no169734ita.0!postnews.google.com!glegroupsg2000goo.googlegroups.com!not-for-mail
Newsgroups: comp.lang.ada
Date: Tue, 26 Mar 2019 03:42:04 -0700 (PDT)
Complaints-To: groups-abuse@google.com
Injection-Info: glegroupsg2000goo.googlegroups.com;
 posting-host=2a01:5c0:e086:51a1:fc7c:2187:e8b7:ba1e;
 posting-account=3Fg1FgoAAACfsmWScNfMD1tGFhR4DU0o
NNTP-Posting-Host: 2a01:5c0:e086:51a1:fc7c:2187:e8b7:ba1e
User-Agent: G2/1.0
MIME-Version: 1.0
Message-ID: <c21fc00c-1d5e-4336-853f-b383cb20985f@googlegroups.com>
Subject: Competing Servers
From: hnptz@yahoo.de
Injection-Date: Tue, 26 Mar 2019 10:42:05 +0000
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable
Xref: reader01.eternal-september.org comp.lang.ada:55968
Date: 2019-03-26T03:42:04-07:00
List-Id: <comp.lang.ada>

Hi,
I want to consider any problem that can be viewed as search, and for which =
only one solution is required, and the problem is suitable for a data paral=
lel approach, provided that the computation time is large enough to make th=
e communication time negligible.

Assume we habe s servers and n tasks. I may start with one server and n tas=
ks. After a simple domain decomposition I want a task only search in its al=
located sub-domain. When one of the tasks has found a solution: it should r=
eport it, all tasks should stop immediately and the initiating program shou=
ld terminate.

A variant from above would be to add a monitoring task, which after receivi=
ng a success message by one of the tasks, should then report and stop all t=
asks immediately and terminate.

An extended approach would be to use different tasks - eg with different se=
arch methods  - in each of the sub-domains. I would then like to define an =
array of a tasks (one for each search method) working on one subdomain. All=
 these tasks are then connected to a collector task.

If there is some experience in this group on the competing tasks aspect? Pl=
ease comment and/or give hints for a solution in Ada.

montgrimpulo