BOINC: how a computational task is distributed between volunteers

Message boards : Questions and problems : BOINC: how a computational task is distributed between volunteers
Message board moderation

To post messages, you must log in.

AuthorMessage
using_namespace

Send message
Joined: 4 Apr 20
Posts: 7
Message 97531 - Posted: 12 Apr 2020, 14:08:12 UTC
Last modified: 12 Apr 2020, 14:11:45 UTC

I am going to deploy a BOINC server for distributed volunteer computing and currently have very basic questions.

To simplify, let's say we have:

  • a single resource-intensive computational task (i.e. a holistic, impartible application)
  • two volunteers subscribed for the project


Questions:


  • Is it possible to ensure that the application will be distributed between the volunteers (i.e. an application will be executed in two threads in this case, for better performance)
  • Or do we need to divide the application into two tasks so that each task would be assigned to 1 volunteer?
  • What part of the documentation can provide some details on this?

ID: 97531 · Report as offensive
Profile Jord
Volunteer tester
Help desk expert
Avatar

Send message
Joined: 29 Aug 05
Posts: 15480
Netherlands
Message 97532 - Posted: 12 Apr 2020, 15:20:51 UTC - in response to Message 97531.  

ID: 97532 · Report as offensive
ProDigit

Send message
Joined: 8 Nov 19
Posts: 718
United States
Message 97538 - Posted: 12 Apr 2020, 22:32:46 UTC
Last modified: 12 Apr 2020, 22:37:01 UTC

In most cases both clients will run the complete work, as there's always one to validate the results.

But if you had 4 or more clients, the situation would be different.

Boinc, fah, and others cut up the task and spread it between the clients (most of the time not considering the clients processing power).
To have a live distribution between the two clients might cost too much CPU and network bandwidth on the server side.

If you want a faster finish of a Wu, you'd spread an entire work over all the available clients, until one runs out of work, and give him work assigned to the slowest client.
ID: 97538 · Report as offensive

Message boards : Questions and problems : BOINC: how a computational task is distributed between volunteers

Copyright © 2024 University of California.
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.