![]() |
|
|
#67 |
|
May 2011
Orange Park, FL
3·5·59 Posts |
|
|
|
|
|
#68 | |
|
Quasi Admin Thing
May 2005
2·3·7·23 Posts |
Quote:
We are in a testing phase still, so Reb wants to have all work currently in progress returned, so he can check if something is not right (It appears that for windows everything works flawlessly). Once we go into full production phase, I hope that the suggestion of returning results for partial completed ranges and reserving and loading new worklines before the last few slow results is submitted - is going to be effectuated. That should thereby make us "never" run out of work and a more regular increase in the credit will be seen. |
|
|
|
|
|
#69 | |
|
If I May
"Chris Halsall"
Sep 2002
Barbados
2×5×7×139 Posts |
Quote:
It doesn't make sense to have to wait for every last assignment to complete in such large assignment blocks before submitting the results to Primenet. His initial test batch of 1,000 assignments (from Primenet, in 102M) has been held up for days because of (currently) 73 outstanding work-units. |
|
|
|
|
|
#70 | |
|
Quasi Admin Thing
May 2005
96610 Posts |
Quote:
If I did understand Reb correctly (and I'm sure I did) and if Reb understood my reply correctly (I'm sure he did), then because the server removes the completed worklines from an active reservation and leave those with no results remaining, turning in results from partially tested ranges and load new work before we reach 0 and more importantly load more work before we have cleared everything - should be possible To be honest I can't really see why it shouldn't happen that way, especially with your new coding. I'm like Reb glad that your new code hands out tests with the same bit, this reduces the preprocessing, since credit is almost or entirely the same for each test ![]() Now we all have to show a little more patience, and then hopefully in the weekend, the last tests with Linux is done and we are good to go with production mode. Anyway how it ends up looking, we will see a huge production increase once we go live
|
|
|
|
|
|
#71 | |
|
If I May
"Chris Halsall"
Sep 2002
Barbados
230028 Posts |
Quote:
Here is some Perl code I use to calculate credit (this was adapted from some PHP code James provided to me several years ago): Code:
sub CalculateGHzDaysTF {
my ($Exp, $From, $To) = @_;
my ($GHzDays, $Cnt);
$GHzDays = 0;
for ($Cnt = $From + 1; $Cnt <= $To; $Cnt++) {
$GHzDays += (0.00707 * 2.4) * (2 ** ($Cnt - 48)) * 1680 / $Exp;
}
return $GHzDays;
}
|
|
|
|
|
|
#72 |
|
P90 years forever!
Aug 2002
Yeehaw, FL
2·53·71 Posts |
Does the BOINC server send out each assignment twice (once for double-checking)? If so, can the server be configured to not do that?
|
|
|
|
|
#73 |
|
"Carlos Pinho"
Oct 2011
Milton Keynes, UK
3·17·97 Posts |
|
|
|
|
|
#74 |
|
"Carlos Pinho"
Oct 2011
Milton Keynes, UK
3·17·97 Posts |
The issue might be on the wu deadline, might be too long.
Trying to find those outstanding wus on the project side to confirm wus deadline. Final edit: deadline is set to 4 days. Last fiddled with by pinhodecarlos on 2020-03-25 at 21:25 |
|
|
|
|
#75 | |
|
Quasi Admin Thing
May 2005
3C616 Posts |
Quote:
If N is lower than 105330000 then: (105330000 div average n of testrange)*1500 = credit for each test If N is higher than 105300000 then: (105330000 div average n of testrange)*1500 = credit for each test This should in the first case for n=98000000 to n=99000000 give this calculation: (105330000 / 98500000)*1500 = 1604 credit per test from 72 to 73 bit This should in the second case for n=109000000 to 110000000 give this calculation: (105330000 / 109500000)*1500 = 1443 credit per test from 72 to 73 bit It all corresponds to the results in the calculation for credit for TF: https://www.mersenne.ca/credit.php and matches the less effort it takes to calculate 1 bit as n increases (Half the effort every doubleing of n) ![]() The calculation is the same as above, if we calculate from 73 to 74 bit, then Reb has to multiply by 2. This means that in case 1, 3208 credit is given per test in BOINC and in case 2, 2886 credit is given per test in BOINC ![]() I've plans to send Reb a more accurate calculation up to n=1,000,000,000 and maybe all the way up to 92 bit - wich I understood long ago is the limit of mfakt(o)(c). Maybe I'll just sent him a calculator or maybe both things, or something else that can make accurate credit for each n possible. I'll discuss that with Reb as we get everything flying. For now, it will be almost accurate credit and most users will end up having the exact same average one way or another, because they stay along for the entire range ![]() @George: No the quorum is 1, it will stay like that
|
|
|
|
|
|
#76 |
|
Sep 2011
Germany
22×32×79 Posts |
Here a short update:
- the deadline was set to 3d but have forgot the grace_periode +1 option, in this case this means if you are over the deadline there will be no send a new task to another host as long as the first host is sending the result back in time if it was over the deadline - the quorum is 1 - for these bits (credits) I can easily test it how much time is needed for a range |
|
|
|
|
#77 | |
|
If I May
"Chris Halsall"
Sep 2002
Barbados
2×5×7×139 Posts |
Quote:
For my own edification (I truly don't know a thing about BOINC)... Why are you doing empirical for the temporal domain? The time it takes for each run will approximately double for each bit level, while decreasing the higher the candidate. As in, a 95M will take more time than a 102M to the same bit level (on, of course, the same GPU). This is what is codified in the Perl I gave you. There is considerable difference in run times between different GPUs on the same work. Does BOINC consider "wall-clock-time" the "value" (regardless of throughput), unlike GIMPS which awards credit as a function of the work done? Consider me a (somewhat strange) stranger in a strange land... |
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Chess World Championship Match -- 2013, 2014, 2016 | Raman | Chess | 34 | 2016-12-01 01:59 |
| mprime ETA and primenet "days to go" do not match | blip | Software | 1 | 2015-11-20 16:43 |
| less v4 reservations being made | tha | PrimeNet | 8 | 2008-08-14 08:26 |
| LL test doesn't match benchmark | drew | Hardware | 12 | 2008-07-26 03:50 |
| WE MADE IT!!!!!!!!!!!!!!!!!!!!!! | eric_v | Twin Prime Search | 89 | 2007-01-23 15:33 |