![]() |
![]() |
#89 | |
"Curtis"
Feb 2005
Riverside, CA
47×101 Posts |
![]() Quote:
You needed 353M relations with A=28 to build a decent matrix; I estimate I=15 to need 4-5% fewer, so target 340M? We're seeing duplicate rates all over the place, so the target is more of a "try msieve here while it keeps sieving" for the way you guys have things set up? |
|
![]() |
![]() |
![]() |
#90 | |
"Ed Hall"
Dec 2009
Adirondack Mtns
2×432 Posts |
![]() Quote:
I am thinking along this line, though: I plan to use msieve for LA on a single machine. I'm thinking that I should oversieve on purpose on the CADO-NFS setup and periodically check whether msieve can build a matrix, instead of expecting CADO-NFS to build the matrix. In that vein, I think, if 270M is required, I should just start with 300M as wanted relations and then let msieve test starting at 270M. That way, CADO-NFS isn't taking up the time trying to build and deciding to go for more relations. Of course, the duplication rate is an issue. Maybe I should use remdups4 and shoot for a unique relations value rather than raw, and use that to adjust the CADO-NFS wanted value of raw. Then again, the duplication rate isn't linear. . . |
|
![]() |
![]() |
![]() |
#91 |
"Curtis"
Feb 2005
Riverside, CA
47×101 Posts |
![]()
I agree with this entirely- 300M target and 270M is a spot to start msieve (assuming 2LP settings). If you use the recent 3LP params, you'd add ~50M relations to both numbers; 3LP is so useful that it's still faster!
I am interested to see a C174-176 with 3LP; I might have to try that myself when the Kosta C198 mini-project is over. I really appreciate your contribution there; you've already nearly guaranteed that we won't spend a month to get to Q=80M. |
![]() |
![]() |
![]() |
#92 |
"Ed Hall"
Dec 2009
Adirondack Mtns
2×432 Posts |
![]()
Glad I can be helpful. I'll stick with the 198 team effort for now. I should be able to add the msieve machine next Tuesday evening. I'm using this to refine some scripts I'm running that take care gracefully dropping some of my machines out of the workforce when they near their bedtime, instead of causing WU timeouts.
|
![]() |
![]() |
![]() |
#93 | |
Apr 2020
241 Posts |
![]()
Good to go this time:
Code:
Thu Apr 30 22:39:41 2020 commencing relation filtering Thu Apr 30 22:39:41 2020 setting target matrix density to 120.0 Thu Apr 30 22:39:41 2020 estimated available RAM is 15845.4 MB Thu Apr 30 22:39:42 2020 commencing duplicate removal, pass 1 ... Thu Apr 30 23:16:49 2020 found 110859058 hash collisions in 375804511 relations Thu Apr 30 23:17:10 2020 commencing duplicate removal, pass 2 Thu Apr 30 23:24:24 2020 found 143912162 duplicates and 231892349 unique relations ... Fri May 1 00:51:57 2020 matrix is 13966788 x 13967013 (6423.2 MB) with weight 1706963165 (122.21/col) Fri May 1 00:51:57 2020 sparse part has weight 1544139266 (110.56/col) Fri May 1 00:51:57 2020 using block size 8192 and superblock size 884736 for processor cache size 9216 kB Fri May 1 00:52:37 2020 commencing Lanczos iteration (6 threads) Fri May 1 00:52:37 2020 memory use: 6066.3 MB Fri May 1 00:53:12 2020 linear algebra at 0.0%, ETA 84h 3m Quote:
|
|
![]() |
![]() |
![]() |
#94 |
Apr 2020
3618 Posts |
![]()
57.6M CPU-seconds of sieving with 3LP at I=15 gave this:
Code:
Tue May 5 13:11:32 2020 commencing relation filtering Tue May 5 13:11:32 2020 setting target matrix density to 110.0 Tue May 5 13:11:32 2020 estimated available RAM is 15845.4 MB Tue May 5 13:11:32 2020 commencing duplicate removal, pass 1 ... Tue May 5 13:47:36 2020 found 115022527 hash collisions in 367310494 relations Tue May 5 13:47:58 2020 commencing duplicate removal, pass 2 Tue May 5 13:55:03 2020 found 154133454 duplicates and 213177040 unique relations ... Tue May 5 15:20:11 2020 matrix is 15594597 x 15594821 (6670.9 MB) with weight 1766271532 (113.26/col) Tue May 5 15:20:11 2020 sparse part has weight 1592785088 (102.14/col) Tue May 5 15:20:11 2020 using block size 8192 and superblock size 884736 for processor cache size 9216 kB Tue May 5 15:20:56 2020 commencing Lanczos iteration (6 threads) Tue May 5 15:20:56 2020 memory use: 6331.9 MB Tue May 5 15:21:37 2020 linear algebra at 0.0%, ETA 110h56m |
![]() |
![]() |
![]() |
#95 |
"Curtis"
Feb 2005
Riverside, CA
474710 Posts |
![]()
Great comparison- same size matrix, 4% less sieve time. That's a win for I=15.
Do you know what the Q-range sieved was? You may be right about the duplicate rate being related to starting sieving at such low Q. It's fast down there, but the duplicate rate makes some of that speed an illusion. I guess that means we don't reduce rels_wanted for I=15 compared to A=28. You could try Q-initial of 5M, see how it affects elapsed time and duplicates. Ideas for future tests: Should we try 31LP on both sides? Since the 3LP side isn't lambda-restrticted, it may make sense to ditch the tight lambda setting on the 2LP side. 31/31 should need 75% the relations of 31/32. Ditching lambda on the 2LP side might need 10% more relations (this number is a guess). mfb=58 and mfb=59 on the 2LP side are worth trying if lambda setting is removed. Finding the optimal ncurves settings could find us another 5% of sieve speed, with no change to matrix size. |
![]() |
![]() |
![]() |
#96 | ||||
Apr 2020
241 Posts |
![]() Quote:
Quote:
Quote:
![]() At some point I suppose I could help out with finding the 2LP/3LP crossover, but I presume it makes sense to optimise 3LP first. Quote:
|
||||
![]() |
![]() |
![]() |
#97 |
"Ed Hall"
Dec 2009
Adirondack Mtns
2·432 Posts |
![]()
I have started a study of duplication in reference to my recent c178 and found something interesting and disappointing. This may be due to my "farm" setup, but I actually have duplicated+ WUs:
Code:
$ ls c180.500000-*.gz c180.500000-510000.k1_rwswi.gz c180.500000-510000.ylvkcw5x.gz Code:
$ ls c180.550000-*.gz c180.550000-560000.bbfy0nc6.gz c180.550000-560000.w31ocae5.gz c180.550000-560000.by9pspsu.gz Code:
$ ls c180.570000-*.gz c180.570000-580000.3w5sj28b.gz c180.570000-580000.5tugazh8.gz c180.570000-580000.46ui0z36.gz c180.570000-580000.a4r_0xaq.gz c180.570000-580000.58h92gje.gz Code:
$ zcat c180.500000-*.gz | ./remdups4 100 >test Found 42946 unique, 43346 duplicate, and 0 bad relations. Code:
$ zcat c180.550000-*.gz | ./remdups4 100 >test Found 41950 unique, 84389 duplicate, and 0 bad relations. Code:
$ zcat c180.570000-*.gz | ./remdups4 100 >test Found 42875 unique, 172369 duplicate, and 0 bad relations. Code:
$ zcat c180.5?0000-*.gz | ./remdups4 100 >test Found 414110 unique, 532836 duplicate, and 0 bad relations. |
![]() |
![]() |
![]() |
#98 | |
Apr 2020
F116 Posts |
![]() Quote:
Now for the promised duplication rate check: 57.6M CPU-seconds of sieving starting at Q=500k gave Code:
Tue May 5 13:55:03 2020 found 154133454 duplicates and 213177040 unique relations Code:
Tue May 5 21:03:43 2020 found 121345816 duplicates and 217856601 unique relations Last fiddled with by charybdis on 2020-05-05 at 21:06 |
|
![]() |
![]() |
![]() |
#99 |
"Curtis"
Feb 2005
Riverside, CA
47×101 Posts |
![]()
I see no reason for lim's to change when LP changes. Let's leave lim's alone for now.
Your test for Q=500k vs 5M is awesome, and conclusive! 2% more uniques for the same sieve time. Let's use Q=5M for this size, pending further investigation (say, 4M or 7M or 10M may be yet better). I agree that test-sieving on ncurves will work- but not a test-sieve at a single Q value. If I did it, I'd want 3 Q's early-mid-late job; in your case, 20-50-80M would convince me. Chances are that what's fastest at one will be fastest at another Q, but I don't think it's obvious that it has to happen that way. I'll post a new params.c180 soon with 31/31LP this afternoon. Progress! As for finding the 2LP/3LP crossover, we only need to test every 5 digits since that's how the params files are organized. The work we're doing could be used to generate e.g. params.c178, which CADO would recognise and use for specifically 178-digit inputs, but the maintainers have already told me not to submit any such params files. Seems like overkill, even for us. |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Integers congruent to last two decimal digits mod 23 | enzocreti | enzocreti | 1 | 2020-03-03 18:38 |
Twin Primes with 128 Decimal Digits | tuckerkao | Miscellaneous Math | 2 | 2020-02-16 06:23 |
Playing with decimal representation | Nick | Puzzles | 9 | 2013-02-13 17:17 |
Decimal Value of Mersenne Prime | vsuite | GPU Computing | 11 | 2011-02-02 04:47 |
Decimal Places | Corbyguy | Software | 3 | 2008-06-09 18:09 |