20090131, 19:50  #1 
(loop (#_fork))
Feb 2006
Cambridge, England
2^{2}×3^{2}×179 Posts 
32/33 and 15e/16e crossover point
These are with N=2^9411, rlim=alim=200M, sieving 200M .. 200M+10^4
Code:
side lp siever yield time/rel alg 32 15 6237 2.29344 alg 33 15 11693 1.21814 alg 32 16 13320 2.79733 alg 33 16 25553 1.45897 rat 32 15 8559 1.99026 rat 33 15 16440 1.03673 rat 32 16 17536 2.57357 rat 33 16 33922 1.30827 This would be a Big Calculation with capital Big; 2.6 seconds per relation and we need half a billion, so 40 CPUyears. 16e is a prodigious user of memory (about 4G virtual of which just over 1G used), so this may be more a project for people with clusters than for random home user  indeed, that might be a bit more of a strain on clusters than their administrators really want. 
20090201, 03:16  #2 
Oct 2006
vomit_frame_pointer
550_{8} Posts 
News I can use?
I may write this down somewhere.
Then again... 
20090202, 10:06  #3  
Oct 2004
Austria
2×17×73 Posts 
Quote:
(BTW: my office box where I used to run my ranges in your factoring projects has got 1 GB RAM, so running 16e will be almost certainly too much if I am present and want to use word, excel, etc., but I will be out of office for ~2 weeks in the beginning of march and therfore can possibly run a small range with 16e in the meantime  iff it fits into 1 GB.) 

20090202, 10:24  #4  
Nov 2008
2·3^{3}·43 Posts 
Quote:


20090202, 11:49  #5 
(loop (#_fork))
Feb 2006
Cambridge, England
2^{2}·3^{2}·179 Posts 
andi47: No feasible 16e run will fit on a 32bit machine. Sorry.
10metreh: next project will be GNFS on 109!+1, starting with a month of polynomial selection; I'm currently trying to find good parameters for the polynomial selection run. 
20090202, 18:20  #6 
Oct 2004
Austria
2×17×73 Posts 

20090202, 19:18  #7  
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
2^{3}×1,201 Posts 
Quote:
When Tom says 4Gb  he means and 4Gb and a bit more, too. (and Win usually needs a big chunk of memory for itself.) This is a project for the 21st century and we'll all have to tweak the tools first. It is possible (and ultimately desirable) that a modified version of the 16e siever will later fit (Tom, I think that for many ranges SCHED_TOL can be actually lowered from 2). But now just yet. 

20090421, 07:59  #8 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
2^{3}×1,201 Posts 
Here are the 32bit reruns with the experimental siever (on a Phenom940):
Code:
side lp siever yield1 sec/rel yield2 sec/rel alg 32 15e 6237 2.29344 6238 (1.01389 sec/rel) rat 32 15e 8559 1.99026 8558 (0.87265 sec/rel) alg 32 16e 13320 2.79733 13322 (1.29829 sec/rel) rat 32 16e 17536 2.57357 17537 (1.16108 sec/rel The number of relns is + a few, too; this is a known effect. The memory footprint, though, for 15e and 16e was 586m (1031m virt.) for 15e 682m (1446m virt.) for 16e Not as bad as with old memory allocations. Not 4g/1g! Note, that I have not quite figured out all new Kleinjung code (lasieve5), indeed there are many changes there ...and there are 15e, 15f, 15g siever variants! 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
QS/NFS crossover points  bsquared  Factoring  24  20160125 05:09 
29 to 30 bit large prime SNFS crossover  VBCurtis  Factoring  11  20150309 07:01 
Moving a point from A to B  kuratkull  Programming  15  20070824 23:00 
any body play with the soft fft crossover yes?  crash893  Software  9  20020918 20:45 
Can I move an exponent near a FFT crossover to my P III?  svempasnake  Software  2  20020909 21:32 