![]() |
|
View Poll Results: Machines I can run 24/7 have | |||
32-bit CPUs or less than 0.75GB per core |
![]() ![]() ![]() ![]() |
4 | 12.90% |
0.75GB memory per core/thread |
![]() ![]() ![]() ![]() |
0 | 0% |
1GB memory per core/thread |
![]() ![]() ![]() ![]() |
15 | 48.39% |
1.5GB memory per core/thread |
![]() ![]() ![]() ![]() |
5 | 16.13% |
2GB memory per core/thread |
![]() ![]() ![]() ![]() |
4 | 12.90% |
More memory than that |
![]() ![]() ![]() ![]() |
3 | 9.68% |
Voters: 31. You may not vote on this poll |
![]() |
|
Thread Tools |
![]() |
#1 |
(loop (#_fork))
Feb 2006
Cambridge, England
2·3,191 Posts |
![]()
You will see attached a list of the numbers mersenneforum has factorised in the last not-quite-two-years.
The sensible thing to do would be to keep attacking the Mersenne numbers from the bottom; 2^863-1 and 2^887-1 are obvious SNFS candidates, 2^899-1 could be either (G185/S271), the time for polynomial selection I think makes it SNFS though G185 would almost certainly get on the Champions list. I'm wondering whether we might want to leave sense behind and attack 2^941-1. It will take probably six concerted months of sieving by the forces that can be gathered here - a bit less if Dodson joins the fray. But it needs -16e, and that means memory. Hence the poll. |
![]() |
![]() |
![]() |
#2 |
"Ben"
Feb 2007
D2B16 Posts |
![]()
I voted 1.5 GB/core, as everything I have access to has at least that. Most have more.
How about for the LA? You'd probably need a 16GB machine for that, no? There are 8 cpu workstations around here that scoff at 16GB; I'd need special permission to confiscate one for the time needed to do it but I'd be willing to ask if necessary. |
![]() |
![]() |
![]() |
#3 | |
Oct 2004
Austria
46628 Posts |
![]()
My machines are running windows XP (32 bit). The largest one (but not running 24/7) has 3 GB available. If 16e is needed, I will be definitely out of the game as I have no machine which has enough memory. (I could run something like Q=10M to 10.1M on the office PC during the christmas holidays if it will still needed then (with the second thread doing prime95 trial factoring or something like this)...
![]() ![]() Quote:
Last fiddled with by Andi47 on 2009-08-18 at 15:24 Reason: repaired smiley (WHY not ;) for a twinkle-smiley?) |
|
![]() |
![]() |
![]() |
#4 |
Oct 2006
vomit_frame_pointer
23×32×5 Posts |
![]()
Good wording on that poll: using units of per core/thread.
This leads to another question: How do core i7 quad-core processors handle 8 threads o' seiving at once? |
![]() |
![]() |
![]() |
#5 |
Oct 2004
Austria
2·17·73 Posts |
![]()
If the machine doesn't have PLENTY of memory, I guess it will be necessary to do less then 8 threads of sieving with 16e and use the other threads for less memory-extensive things.
|
![]() |
![]() |
![]() |
#6 |
Account Deleted
"Tim Sorbera"
Aug 2006
San Antonio, TX USA
17·251 Posts |
![]()
My CPU is 64-bit, (and dual-core) it's the OS that's 32-bit.
![]() Not that my ability to participate should hold too much weight in this... Last fiddled with by Mini-Geek on 2009-08-18 at 16:05 |
![]() |
![]() |
![]() |
#7 |
Oct 2006
vomit_frame_pointer
23×32×5 Posts |
![]()
I'm more worried about how Intel's memory bus handles the I-O to RAM for 8 such memory-intensive processes. I believe fivemack has an i7 920 in his server farm.
|
![]() |
![]() |
![]() |
#8 |
Oct 2004
Austria
1001101100102 Posts |
![]()
Which poly would be used for M941? This one? (parameters are an extrapolation of those I have seen in the mersenneforum for large SNFSes;
skew: I guess 21/6?) Code:
n: 2468815427808777830385945175570959888649322954010151512577652841207233127175594988619285951813249353482864131674513502872982111245757912252275917421142241044267118542381889815949472721865947896251559297022100274282885756253947868389157090816092206938192397903861973556952725044519 c6: 1 c0: -2 Y0: 182687704666362864775460604089535377456991567872 Y1: 1 skew: 1.12 rlim: 200000000 alim: 200000000 lpbr: 32 lpba: 32 mfbr: 64 mfba: 64 rlambda: 2.6 alambda: 2.6 Code:
total yield: 44, q=70000213 (7.73545 sec/rel) Last fiddled with by Andi47 on 2009-08-18 at 16:50 Reason: benchmark |
![]() |
![]() |
![]() |
#9 |
(loop (#_fork))
Feb 2006
Cambridge, England
2×3,191 Posts |
![]()
On previous large, but not 16e, NFS sieving jobs, I've found that running eight jobs, each assigned with taskset to one thread of the i7/920, gives about 40% more throughput than running four jobs each assigned to one core of the i7/920 with the other threads unloaded.
(IE it can be a 4 x 2.8GHz machine or effectively an 8 x 2GHz machine) I think I've done the measurements to show that 2^941-1 is still a 32/32 problem, meaning the matrix shouldn't be worse than 30M on a side and will be happy on the i7 that I have already. The sieving's the hard part. I need to figure out whether 200M is the right limit, and for a job this big I ought to get round to doing the analysis of duplication rates to see if it's better to do one side or both. On a 2.66GHz Core2Duo that I have lying around here, running Code:
./batalov-lasieve/gnfs-lasieve4I16e -a M941.poly -f 70000000 -c 200 Code:
22952 twomack 25 0 978m 456m 504 R 100 22.9 1:32.15 gnfs-lasieve4I1 Code:
total yield: 44, q=70000213 (1.65068 sec/rel) Last fiddled with by fivemack on 2009-08-18 at 17:14 |
![]() |
![]() |
![]() |
#10 |
Account Deleted
"Tim Sorbera"
Aug 2006
San Antonio, TX USA
10000101010112 Posts |
![]()
How much harder would it be to break the SNFS record (M1039) than M941? Candidates might be M1051 (22-bit factor known, 1030-bit cofactor) or M1061 (no factors known).
Last fiddled with by Mini-Geek on 2009-08-18 at 17:28 |
![]() |
![]() |
![]() |
#11 |
Tribal Bullet
Oct 2004
2×3×19×31 Posts |
![]()
for 1000+ bit numbers you'd need large primes > 32 bits, which msieve cannot currently handle. You would also need > 2^32 relations, which msieve also cannot currently handle (though that's easier to fix).
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
"Hybrid Memory Cube" offers 1 Tb/s memory bandwith at just 1.4 mW/Gb/s | ixfd64 | Hardware | 4 | 2011-12-14 21:24 |
Memory available to P-1 | lycorn | Software | 23 | 2010-05-09 22:15 |
memory | victorvicentim | Information & Answers | 5 | 2009-08-19 12:34 |
How much memory? | Unregistered | Software | 29 | 2004-09-04 19:35 |
P-1 Memory... | Xyzzy | Marin's Mersenne-aries | 7 | 2004-03-12 13:34 |