![]() |
|
|
#34 | |
|
Oct 2005
Italy
3×113 Posts |
Ok.
Gribozavr, are you sieving until 25G ? In the future (if no primes are found, of course) should somebody start sieving from 25G to, say, 50G with these parameters in NewPGen (correct me if wrong): Quote:
|
|
|
|
|
|
|
#35 |
|
Mar 2005
Internet; Ukraine, Kiev
11×37 Posts |
Yes, to 25G = 25e12
|
|
|
|
|
|
#36 |
|
"Jason Goatcher"
Mar 2005
3·7·167 Posts |
I think it would be a good idea to do distributed sieving at some point. If I'm not mistaken, it can be implemented easily in NewPGen. Of course, the problem would be trying to figure out how to have different sized work-units. If it's simply a matter of text-editing, maybe someone could write a tutorial?
|
|
|
|
|
|
#37 |
|
Nov 2006
23·11 Posts |
Quick update: first BOINCLLR workunit finished successfully in 6 minutes 18 seconds under Celeron M 1.3GHz :)
925002423*2^195000-1isnotprime.LLRRes64:9EAF7A23BA5551FCTime:512.384sec. (don't ask me why it is compressed without spaces. Who needs them anyway :D) |
|
|
|
|
|
#38 |
|
Oct 2005
Fribourg, CH
22×32×7 Posts |
I've got a gentoo box, 805D 2.66Ghz. I could sieve this range with it :)
|
|
|
|
|
|
#39 |
|
Oct 2005
Italy
3·113 Posts |
Uhm ... it seems to me that 512 sec is too much (usually LLR.exe takes just 100 sec).
|
|
|
|
|
|
#40 |
|
Jun 2003
23×683 Posts |
|
|
|
|
|
|
#41 | |
|
Oct 2005
Italy
3·113 Posts |
Quote:
Do you mean assigning different ranges to different users or what ? |
|
|
|
|
|
|
#42 |
|
Nov 2006
23×11 Posts |
It was 6 minutes 18 seconds CPU time, and above 8 minutes wall clock time (it is still increasing when BOINC has suspended the calculations). I'm not sure if it's related to modified client or not, but I think I got pretty much the same speed with original LLR client, so I guess it does not make any difference. I'll probably implement the work generator today and we can test the speed tomorrow :)
|
|
|
|
|
|
#43 |
|
Oct 2005
Fribourg, CH
22×32×7 Posts |
Sieving 25G-50G has started :
Code:
Please, enter your choice (0) : 2 Base = 2 Include even k's ? (n) : n n = 195000 kmin = 25000000000 kmax = 50000000000 The range of k that you have specified (25000000001) is too large to fit into the bitmap, which can hold -226492416 k's. This is not too much of a problem, as NewPGen will break this up into 0 smaller ranges and sieve each in turn up to 1 billion before combining them and sieving together. However, you might like to consider increasing the bitmap size. Do you wish to continue? (y) : y Type : Twin: k.b^n�1 Are you ready to start sieving ? (y) : y CPU capabilities: CMOV: Supported. SSE2: Supported. Using bitmap : allocating 485.0Mb of RAM... ...succeeded Sieving from k = 25000000000 to k = 29068474880... Sieving numbers with 58712 decimal digits |
|
|
|
|
|
#44 |
|
Quasi Admin Thing
May 2005
17×59 Posts |
Rytis have 50 LLR results ready for testing, I've done the 50 first results, and Rytis is looking for others to help him test the 50 counter results, which should be used for validating the test. Anohter advantage by letting Rytis help us test all the ranges, and you to only manage the sieving, is that every result is double checked right away :) Go join primegrid and then do following:
Push "View or edit" in the row containing "PrimeGrid preferrences" Choose yes in "Run Test Application" See U all at Primegrid :) Also in case of troubles, feel free to ask questions :) |
|
|
|
![]() |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| BOINC | Unregistered | Information & Answers | 6 | 2010-09-21 03:31 |
| BOINC.BE | BATKrikke | Teams | 2 | 2010-03-05 18:57 |
| Boinc | Xentar | Sierpinski/Riesel Base 5 | 4 | 2009-04-25 10:26 |
| BOINC? | masser | Sierpinski/Riesel Base 5 | 1 | 2009-02-09 01:10 |
| BOINC | bebarce | Software | 3 | 2005-12-15 18:35 |