Message boards : Questions and problems : Communicating with Boinc Client -please wait
Message board moderation
Author | Message |
---|---|
Send message Joined: 21 Mar 09 Posts: 23 ![]() |
I occasionally keep getting this message and it is a pain in the neck as it often stops boinc for about a minutes then they run for a little while then the message appears again sometimes as little as 3 seconds the trouble is when it shows everything else on my pc stops as well it would be useful to have details of which project it is and an option to not let it connect as it only gives two options of closing boinc or clear neither of which are helpful |
![]() Send message Joined: 29 Aug 05 Posts: 15632 ![]() |
How much work do you have in your cache? Which BOINC version is this with? If 6.6 or below, a fix for it is in BOINC 6.10, presently in testing. The problem is that if you have a lot of work in your cache, that all that work will have to be shown through a remote procedure call (RPC) of 1 second, as that's the "real-time" update frequency BOINC Manager uses. Lots of work in cache can mean that you use 1.5 seconds for that update, meaning it cannot be done in the 1 second frame. BOINC 6.10 has a solution for this in the form of a "Show active tasks/Show all tasks" button. When pressed, to show only the active tasks, it the Tasks tab will only show all Running and Ready to run tasks, none of the Ready to start ones. That will make sure that all the information it is getting from the client can be shown in that 1 seconds time frame. |
![]() Send message Joined: 8 Aug 08 Posts: 570 ![]() |
I occasionally keep getting this message and it is a pain in the neck as it often stops boinc for about a minutes then they run for a little while then the message appears again sometimes as little as 3 seconds I don't want to make a double entry, but BoincTasks is specially designed to do this even better. http://www.efmer.eu/boinc/boinc_tasks/index.html |
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.