Message boards :
Questions and problems :
Spinhenge running high priority, do I have too many projects?
Message board moderation
Previous · 1 · 2
Author | Message |
---|---|
Send message Joined: 21 May 07 Posts: 349 |
No, Dagorath, you possibly misunderstood, what they said. 5.10.45 http://sciencesprings.wordpress.com http://facebook.com/sciencesprings |
Send message Joined: 29 Aug 05 Posts: 147 |
It depends on the version of your client, some it is the connect setting, some it is 24 hours. There is also an 80% fudge factor in some of the calculations. Actually, in the formula quoted, the safety margin is either 24 hours (older version) or 0 (newer version). There was a completely different formula for even older versions (which I hope that nobody is asking about as I believe the switchover was pre 5.0. BOINC WIKI |
Send message Joined: 29 Aug 05 Posts: 147 |
No, Dagorath, you possibly misunderstood, what they said. The rules of reporting are not quite that simple. While BOINC assumes that it may not have a connection for "Connect every X" it will use a connection that it has available as "NOW" might be the last time the computer is connected for a while. BOINC reports work at the first of: 24 hours before due. Connect every X before due. Immediately if it is later than the above 2 entries. 24 hours after completion. On a work request. On a trickle up (CPDN and associated projects only so far, but I believe that QCN may use this feature). On a trickle down request (no uses yet). On a timed request (a new project wants a contact ever X period - not in general circulation yet). On a manual connect. BOINC WIKI |
Send message Joined: 3 Apr 06 Posts: 547 |
And any idle core will be immediately supplied with work. (Except that you (well, mitrichr) have revealed a bug in the client.) I assume they are much simpler regarding feeding idle cores with fresh work? ;-) (OK, I've torn your words from the context, my apology.) Peter |
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.