From: hnptz@yahoo.de
Subject: Competing Servers
Date: Tue, 26 Mar 2019 03:42:04 -0700 (PDT)
Date: 2019-03-26T03:42:04-07:00 [thread overview]
Message-ID: <c21fc00c-1d5e-4336-853f-b383cb20985f@googlegroups.com> (raw)
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 parallel approach, provided that the computation time is large enough to make the communication time negligible.
Assume we habe s servers and n tasks. I may start with one server and n tasks. After a simple domain decomposition I want a task only search in its allocated sub-domain. When one of the tasks has found a solution: it should report it, all tasks should stop immediately and the initiating program should terminate.
A variant from above would be to add a monitoring task, which after receiving a success message by one of the tasks, should then report and stop all tasks immediately and terminate.
An extended approach would be to use different tasks - eg with different search 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? Please comment and/or give hints for a solution in Ada.
montgrimpulo
next reply other threads:[~2019-03-26 10:42 UTC|newest]
Thread overview: 6+ messages / expand[flat|nested] mbox.gz Atom feed top
2019-03-26 10:42 hnptz [this message]
2019-03-26 13:11 ` Competing Servers Dmitry A. Kazakov
2019-03-26 15:50 ` Anh Vo
2019-03-26 17:03 ` Dmitry A. Kazakov
2019-04-01 19:21 ` Anh Vo
2019-04-01 19:58 ` Dmitry A. Kazakov
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox