Message boards : Questions and problems : Client downloads Tasks and runs not by Deadline Date Priority
Message board moderation
Author | Message |
---|---|
Send message Joined: 31 Aug 23 Posts: 1 |
Boinc Client (Windows 10) Version 7.22.2 (x64) Hello - Is there a way to set the Client process tasks by Deadline date priority? I note that when a fresh batch of Asteroids@Home are downloaded, that no matter the Deadline date of Einstein@Home is set at, the newly downloaded Asteroids@Home tasks start immediately and places the existing Einstein@Home tasks on 'hold'. I'd rather set the client to process tasks by Deadline date in chronological order to ensure that each tasks are completed at or before their Deadline date. Thanks in advance, David |
Send message Joined: 31 Dec 18 Posts: 315 ![]() |
Boinc Client (Windows 10) Version 7.22.2 (x64) Boinc has a complex mechanism to ensure that the maximum amount of work is completed without any of it missing the deadline. This mechanism also ensures that your preferences as to the relative workload for each project is respected (in the long term). What you are seeing is Boinc reacting to new work by saying “this project is behind in its workload so I’ll give it priority which I can do because the existing tasks are well within deadline”. The less you touch this system the better it will run and no matter how much you try to tweak the system you will not get it to run in strict deadline date order. |
![]() ![]() Send message Joined: 17 Nov 16 Posts: 906 ![]() |
Boinc Client (Windows 10) Version 7.22.2 (x64) Yes, you can help out the credit rebalancing among projects that the client does to converge much faster if you change a default setting in the cc_config.xml file. Change: <rec_half_life_days>10.000000</rec_half_life_days> To: <rec_half_life_days>1.000000</rec_half_life_days> This will shorten the averaging function timespan from 10 days to a single day. You would see the host return to Einstein work much faster after it has repaid its dept to the Asteroids project. |
Copyright © 2025 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.