mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > Aliquot Sequences

Reply
 
Thread Tools
Old 2010-01-12, 17:49   #1
10metreh
 
10metreh's Avatar
 
Nov 2008

2×33×43 Posts
Default Team sieve #17: c163 from 4788:2509

Postprocessing will be done by Joshua2

Linear algebra is complete! Factors as p61*p103

Poly:
Code:
n: 8519618226197093878278613851429334276607578086560582046132272468491047228903383713809367142607155237315475444625223025926760239272565192820910356755196796601078683
# norm 4.832139e-16 alpha -8.365564 e 6.936e-13
skew: 82092126.77
c0: -4506332652721281857439312883465578850580235
c1:  1546557538158535979212952557252545273
c2: -493361789599381258970904335
c3: -1674326900805118095209
c4: -406958861894
c5:  22800
Y0: -51819960992313118269272571928496
Y1:  813459549425076319
rlim: 50000000
alim: 50000000
lpbr: 30
lpba: 30
mfbr: 60
mfba: 60
rlambda: 2.6
alambda: 2.6
Use siever 14e, sieve 20M-120M Q.

Command line:
Code:
gnfs-lasieve4I14e -a 4788_2509.poly -o <output_file_name> -f <start_of_range> -c <length_of_range>
where 4788_2509.poly is the poly file above.

Reservations:
Code:
  Range      Who
*19.9M- 20M  Andi47 (15e siever; done, 243426 relations)
*  20M- 21M  Andi47 (done, 1146336 relations)
*  21M- 22M  Greebley (done, 1149732 relations)
*  22M- 40M  bsquared (done, 21936082 relations)
*  40M- 41M  EdH (done, 1237326 relations)
*  41M- 50M  FactorEyes (done, 11286234 relations)
*  50M- 60M  fivemack (done, 12196919 relations)
*  60M- 67M  fivemack (done, 8146713 relations)
*  67M- 70M  Andi47 (done, 3419791 relations)
*  70M- 71M  Andi47 (done, 1122887 relations)
*  71M-110M  RSALS grid (done, about 33606932 relations)
* 110M-111M  Andi47 (done, 964336 relations)
* 111M-115M  bsquared (done, 3845345 relations)
* 115M-119M  bsquared (done, 3811160 relations)
* 119.0-.4M  Andi47 (done, 377383 relations)
Total relations received: 104490602

Use a site such as Sendspace to upload relations.
Please do not use Rapidshare if possible as it has time consuming restrictions.

Last fiddled with by Mini-Geek on 2010-02-08 at 13:13
10metreh is offline   Reply With Quote
Old 2010-01-12, 18:59   #2
Andi47
 
Andi47's Avatar
 
Oct 2004
Austria

46628 Posts
Default

Quote:
Originally Posted by 10metreh View Post
Use siever 14e, sieve 20M-120M Q.
Have you tested the 15e siever? We might be near the crossover line...

BTW: Reserving 20M - 21M
Andi47 is offline   Reply With Quote
Old 2010-01-12, 19:27   #3
Greebley
 
Greebley's Avatar
 
May 2009
Dedham Massachusetts USA

3×281 Posts
Default

I will grab 21-22 M
Greebley is offline   Reply With Quote
Old 2010-01-12, 20:22   #4
jrk
 
jrk's Avatar
 
May 2008

3·5·73 Posts
Default

Quote:
Postprocessing will be done by ? (4GB RAM needed)
Maybe only 2.5GB for the linear algebra, or less with sufficient over-sieving. What about the filtering stage? Tom, how much did the filtering need for the c161 in December?

Quote:
Originally Posted by Andi47 View Post
Have you tested the 15e siever? We might be near the crossover line...
I already did.

Here are the tests with 14e (to get the range of Q needed):
Code:
Warning:  lowering FB_bound to 9999999.
total yield: 837, q=10001009 (0.15551 sec/rel)
Warning:  lowering FB_bound to 14999999.
total yield: 1323, q=15001001 (0.13859 sec/rel)
Warning:  lowering FB_bound to 19999999.
total yield: 1107, q=20001001 (0.13996 sec/rel)
Warning:  lowering FB_bound to 29999999.
total yield: 1210, q=30001003 (0.13541 sec/rel)
Warning:  lowering FB_bound to 39999999.
total yield: 1262, q=40001021 (0.13996 sec/rel)
total yield: 1205, q=50001037 (0.13965 sec/rel)
total yield: 968, q=60001021 (0.15442 sec/rel)
total yield: 706, q=70001011 (0.14997 sec/rel)
total yield: 1010, q=80001017 (0.15086 sec/rel)
total yield: 1230, q=90001003 (0.15591 sec/rel)
total yield: 961, q=100001029 (0.16170 sec/rel)
total yield: 1222, q=110001053 (0.16511 sec/rel)
And spot-checking with 15e for comparison
Code:
Warning:  lowering FB_bound to 19999999.
total yield: 2399, q=20001001 (0.17222 sec/rel)
total yield: 2598, q=50001037 (0.15870 sec/rel)
total yield: 2108, q=80001017 (0.17734 sec/rel)
Quite a bit slower with 15e.
jrk is offline   Reply With Quote
Old 2010-01-12, 20:40   #5
Joshua2
 
Joshua2's Avatar
 
Sep 2004

13·41 Posts
Default

I could do postproc with my quad core q9600 @ 3ghz w/ 8gb mem unless someone has better. You would have to walk me through because I've never done it except when everything is automated.

Last fiddled with by Joshua2 on 2010-01-12 at 20:40
Joshua2 is offline   Reply With Quote
Old 2010-01-12, 20:54   #6
bsquared
 
bsquared's Avatar
 
"Ben"
Feb 2007

2×5×7×47 Posts
Default

Quote:
Originally Posted by Joshua2 View Post
I could do postproc with my quad core q9600 @ 3ghz w/ 8gb mem unless someone has better. You would have to walk me through because I've never done it except when everything is automated.
Using msieve, this is easy. You may not be familiar with jobs of this size though, so just so you know what you're getting into:
* expect to not use that PC for several days to a week, as any other process running on it will be slowed to a crawl
* unless you have ECC memory, plan on checking up on it occasionally and restarting from checkpoints as necessary
* unless you also plan on doing a significant amount of sieving, be ready to download many gigabytes of relation data

Still want to?

Definitely not trying to discourage you, and apologies if you are aware of this already...

reserving 22-40M
bsquared is offline   Reply With Quote
Old 2010-01-12, 20:58   #7
jrk
 
jrk's Avatar
 
May 2008

3×5×73 Posts
Default

Quote:
Originally Posted by Joshua2 View Post
I could do postproc with my quad core q9600 @ 3ghz w/ 8gb mem unless someone has better. You would have to walk me through because I've never done it except when everything is automated.
Do you have at least 20GB of unused disk space? The relations file will be at least 10GB unpacked, and msieve will create some other large-ish files during the processing.

Jason's msieve is easy enough to use, you should not have any difficulty learning it. Basically all you'd need to do is to download and keep track of the relation files produced here, untar/zip/whatever and combine them all into a msieve.dat file,

make a worktodo.ini file containing:
Code:
N 8519618226197093878278613851429334276607578086560582046132272468491047228903383713809367142607155237315475444625223025926760239272565192820910356755196796601078683
a msieve.fb file containing the poly in msieve format:
Code:
N 8519618226197093878278613851429334276607578086560582046132272468491047228903383713809367142607155237315475444625223025926760239272565192820910356755196796601078683
SKEW 82092126.77
A0 -4506332652721281857439312883465578850580235
A1  1546557538158535979212952557252545273
A2 -493361789599381258970904335
A3 -1674326900805118095209
A4 -406958861894
A5  22800
R0 -51819960992313118269272571928496
R1  813459549425076319
and run:
msieve -v -nc -t 4
(for 4 threads)

Should take less than a week of wall-time, assuming the computer is otherwise relatively idle.
jrk is offline   Reply With Quote
Old 2010-01-12, 22:44   #8
Joshua2
 
Joshua2's Avatar
 
Sep 2004

13×41 Posts
Default

Quote:
Originally Posted by bsquared View Post
Using msieve, this is easy. You may not be familiar with jobs of this size though, so just so you know what you're getting into:
Thanks. I have plenty of diskspace and bandwith, but no ecc, but I could check on it if I know what to look for, but I have be able to use the computer. I always have stuff running and just put it at low priority, that won't work for this? I would think it saying 4gb needed I would be able to do stuff occasionally with 8gb.

Last fiddled with by Joshua2 on 2010-01-12 at 22:45
Joshua2 is offline   Reply With Quote
Old 2010-01-12, 22:55   #9
bsquared
 
bsquared's Avatar
 
"Ben"
Feb 2007

63328 Posts
Default

You could run msieve with lowest priority, and then you can use your cpu as normal. However I've never been completely satisfied with cpu schedulers in this regard... it always seems like the system is less responsive even if the heavy job is low priority (windows, anyway).

Also, if normal operation for you is to be continuously doing other cpu intensive tasks on multiple cores, then the matrix runtime will be significantly extended. Impatient people around here may object to that. Otherwise I think normal part-time use would be fine, provided you can live with the performance of the system with msieve running in the background.

I'm not really sure how crucial ECC memory is to large matrix jobs; Batalov I know has run into problems before, but I haven't personally. From what I gather, the Lanczos routine will abort with an error message and you need to manually restart it using -ncr.
bsquared is offline   Reply With Quote
Old 2010-01-12, 23:00   #10
fivemack
(loop (#_fork))
 
fivemack's Avatar
 
Feb 2006
Cambridge, England

5×31×41 Posts
Default

Isn't the right comparison with 15e using 29-bit large primes?
fivemack is offline   Reply With Quote
Old 2010-01-13, 00:09   #11
Joshua2
 
Joshua2's Avatar
 
Sep 2004

13·41 Posts
Default

I normally run cpu intensive stuff in the background at idle, but I would cancel them during the duration of this project. Sometimes I game though or just surf the web.
Joshua2 is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Team sieve #42: C161 from 4788:i5193 RichD Aliquot Sequences 49 2013-12-17 12:27
Team sieve #34: c148 from 4788:i2910 jrk Aliquot Sequences 14 2012-02-24 15:10
Team sieve #33: c147 from 4788:i2902 jrk Aliquot Sequences 28 2012-02-07 20:19
Team sieve #24: c155 from 4788:2618 schickel Aliquot Sequences 26 2011-02-24 23:19
Team sieve #21: c162 from 4788:2602 jrk Aliquot Sequences 31 2010-12-30 21:33

All times are UTC. The time now is 13:20.

Sat Sep 19 13:20:47 UTC 2020 up 9 days, 10:31, 1 user, load averages: 1.29, 1.34, 1.41

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.