![]() |
|
|
#2366 |
|
May 2013
East. Always East.
11·157 Posts |
Shouldn't factoring 63M to 74 be the priority then? Or is that the thing about some user having a whole bunch of 63M reserved and not handing in results?
|
|
|
|
|
|
#2367 | |
|
"Mr. Meeseeks"
Jan 2012
California, USA
23·271 Posts |
Quote:
|
|
|
|
|
|
|
#2368 |
|
"Kieren"
Jul 2011
In My Own Galaxy!
100111101011102 Posts |
My P-1s are all ~63.5M. They yield ~ 4 GHz-days apiece.
A ~63M TF from 73-74 coughs up ~30 GHz-days. I crank out a lot more of those. Such are the joys of 2 GPUs. The P-1s are something to keep the CPU cores busy in the meantime. Last fiddled with by kladner on 2013-09-07 at 00:33 |
|
|
|
|
|
#2369 | |
|
If I May
"Chris Halsall"
Sep 2002
Barbados
230478 Posts |
Quote:
And trust us.... |
|
|
|
|
|
|
#2370 |
|
May 2013
East. Always East.
110101111112 Posts |
|
|
|
|
|
|
#2371 | |
|
Account Deleted
"Tim Sorbera"
Aug 2006
San Antonio, TX USA
102538 Posts |
Quote:
Having more memory speeds up stage 2. If you have more memory, then, you increase the range of prime factors that might be found, while the time required may go up or down (whatever it takes to find factors most efficiently). If you have so little memory allowed that Prime95 decides to skip stage 2, it will choose a slightly higher B1 (i.e. a longer stage 1), but the overall test will take less time than with a stage 2. So in practice, more memory might actually make the P-1 for a single number take longer, but with a higher chance of finding a factor, which means better efficiency for you and GIMPS (more factors cleared per time spent). (something interesting I just realized: there's a slim chance that for a given exponent, you'd find a factor by assigning the minimum memory and skipping stage 2, and you'd miss that factor if you assign a generous amount of memory and thus choose a lower B1; this would occur if, e.g. the former B1=B2=660 000 and the latter B1=570 000, B2=11 000 000 and the k in the factor has 2 or more factors n with 570 000 < n < 660 000) |
|
|
|
|
|
|
#2372 | |
|
"Richard B. Woods"
Aug 2002
Wisconsin USA
22×3×641 Posts |
Quote:
Here's one explanation of the two different ways of invoking P-1 and their different relationships between B1/B2 bounds, "available memory", speed, and probability of finding a factor. Here's another version. [I still haven't posted a grand amalgamated version at mersennewiki.org :-( ] Last fiddled with by cheesehead on 2013-09-09 at 08:22 |
|
|
|
|
|
|
#2373 |
|
Aug 2002
Termonfeckin, IE
ACC16 Posts |
Looks like Primenet is assigning 67Ms. SPE chalsall?
|
|
|
|
|
|
#2374 |
|
If I May
"Chris Halsall"
Sep 2002
Barbados
9,767 Posts |
|
|
|
|
|
|
#2375 | |
|
"Kieren"
Jul 2011
In My Own Galaxy!
2×3×1,693 Posts |
SPE? (I'm sure it's obvious, but the meaning eludes me.)
http://en.wikipedia.org/wiki/SPE Quote:
|
|
|
|
|
|
|
#2376 |
|
Aug 2002
North San Diego County
5·137 Posts |
In this context SPE is Stupid Programmer Error (TM chalsall).
|
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Status | Primeinator | Operation Billion Digits | 5 | 2011-12-06 02:35 |
| 62 bit status | 1997rj7 | Lone Mersenne Hunters | 27 | 2008-09-29 13:52 |
| OBD Status | Uncwilly | Operation Billion Digits | 22 | 2005-10-25 14:05 |
| 1-2M LLR status | paulunderwood | 3*2^n-1 Search | 2 | 2005-03-13 17:03 |
| Status of 26.0M - 26.5M | 1997rj7 | Lone Mersenne Hunters | 25 | 2004-06-18 16:46 |