![]() |
|
|
#353 | |
|
Jun 2003
Ottawa, Canada
100100101012 Posts |
Quote:
Jeff. |
|
|
|
|
|
|
#354 | |
|
May 2009
Dedham Massachusetts USA
3·281 Posts |
Quote:
----- I noticed in factMSieve.pl a reference to minrels.txt. I was wondering if this is a way to better specify how many relations are needed for different size numbers. Anyone know anything about it? Ideal would be a file with values already set up for GNFS (i.e. not SFNS). Last fiddled with by Greebley on 2009-11-05 at 16:16 |
|
|
|
|
|
|
#355 | |
|
Just call me Henry
"David"
Sep 2007
Cambridge (GMT/BST)
5,881 Posts |
Quote:
it has to be set for each number |
|
|
|
|
|
|
#356 |
|
May 2009
Dedham Massachusetts USA
3×281 Posts |
|
|
|
|
|
|
#357 | |
|
Jun 2003
Ottawa, Canada
3·17·23 Posts |
Quote:
12345678 So for any run it will wait until you have at least 12345678 relations before proceeding to post-processing. |
|
|
|
|
|
|
#358 |
|
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
24·593 Posts |
No, just a single number for the project in the current directory. If you have many projects running, you may have many MINRELS.txt files in each directory. Consider it an extension to the .poly file, but the difference is that .poly file is read only once, while this file (if exists) is read before starting each filtering phase.
The idea is to edit this file between filtering cycles, without stopping the perl script. It used to be easier to adjust this number (msieve actually reported pretty accurately how many more relations if still wants, but recently it doesn't, just says a 1000000). Also, search forum. |
|
|
|
|
|
#359 |
|
Oct 2009
32·7 Posts |
Please, can anyone tell, how many unique relations typically needed for C154 factorizing? In general.
Tanx. |
|
|
|
|
|
#360 |
|
(loop (#_fork))
Feb 2006
Cambridge, England
2×132×19 Posts |
It depends on the large-prime bound.
Generally, 2^{large primes}/10 is about right. |
|
|
|
|
|
#361 |
|
Oct 2009
32×7 Posts |
As they said:
Code:
For the lattice sieve, a factor base bound of 16 777 216 (2^24) was chosen, both for the rational and for the algebraic side. Two large primes were allowed on both sides. Most of the line sieve was carried out with two large primes on both the rational and the algebraic side. The rational factor base consisted of the primes < 44 000 000 and the algebraic factor base of the primes < 110 000 000. Some line sieving allowed three large primes instead of two on the algebraic side. In that case the rational factor base consisted of the primes < 8 000 000 and the algebraic factor base of the primes < 25 000 000. For both sieves the large prime bound 1 000 000 000 was used both for the rational and for the algebraic primes. A total of 124 722 179 relations were generated, 71% of them with lattice sieving (L), 29% with line sieving (C). Among them, there were 39 187 441 duplicates, partially because of the simultaneous use of the two sievers. Sieving was done at eleven different locations with the following contributions: As they said, collected 125M relations with 40M duplicates. So nearly 85M Unique relations.... For one C148 and another C154 numbers i had success with 78M relations with 30M duplicates. Similar for bot numbers. But current c155 wants more sieving after 60M. Thats why i asking. Code:
The relations were collected at CWI and required 3.7 Gbytes of disk space Thanks! Last fiddled with by siew on 2009-11-06 at 18:04 |
|
|
|
|
|
#362 |
|
Oct 2009
32·7 Posts |
Also, when i running the GNFS on >1 threads the parallel jobs looks like that:
Code:
skew: 284391.86 rlim: 18700000 alim: 9350000 lpbr: 29 lpba: 29 mfbr: 58 mfba: 58 rlambda: 2.6 alambda: 2.6 q0: 9350000 qintsize: 50000 skew: 284391.86 rlim: 18700000 alim: 9350000 lpbr: 29 lpba: 29 mfbr: 58 mfba: 58 rlambda: 2.6 alambda: 2.6 q0: 9400000 qintsize: 50000 #q1:9450000 Code:
rlim: 18700000 alim: 18700000 lpbr: 29 lpba: 29 mfbr: 58 mfba: 58 rlambda: 2.6 alambda: 2.6 Code:
alim: 18700000 Code:
alim: 9350000 |
|
|
|
|
|
#363 | |
|
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
24×593 Posts |
Quote:
I think I've found a reasonable set of defines that should cover the 16/15 L1_BITS choice problem and added it to the SVN 382 source. (Basically, AMD K7 and above [not K6] are going to benefit most; Core2s, intermediately; old CPUs should not use the new binaries.) These are #defines (run time CPUid discovery is not a trick we want to use; too late, all optimizations, loop unrolls are already done), so in Windows cross-builds you may want to define __k8__ in the solution for one build, or not, for another, and check what happens with test sieving on various comps. If you have a pentiumIII or a pentium4, you may want to manually redefine L1_BITS to 14 or even 13 (for very old CPUs; however, only sievers up to L1_BITS+1 are functional run-time. So for old CPUs, 15e can only be built with L1_BITS 14, and it will be slow, naturally, but that's the only way; and they will not afford 16e -- who want 10 sec/rel yield anyway...). All: I've added the same to the experimental/lasieve4_64/athlon64/ but there is an additional instruction added to the INSTALL file. Read it for Core2. AMDs will fly, Opterons, Phenoms, Athlons. |
|
|
|
|
![]() |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Installation of GGNFS | LegionMammal978 | Msieve | 17 | 2017-01-20 19:49 |
| Running other programs while running Prime95. | Neimanator | PrimeNet | 14 | 2013-08-10 20:15 |
| Error running GGNFS+msieve+factmsieve.py | D. B. Staple | Factoring | 6 | 2011-06-12 22:23 |
| GGNFS or something better? | Zeta-Flux | Factoring | 1 | 2007-08-07 22:40 |
| ggnfs | ATH | Factoring | 3 | 2006-08-12 22:50 |