![]() |
![]() |
#12 |
Jun 2012
3,847 Posts |
![]()
What was command line for msieve-GPU?
|
![]() |
![]() |
![]() |
#13 |
"Curtis"
Feb 2005
Riverside, CA
2·5·563 Posts |
![]()
CPU search on msieve is hopeless- all our norm suggestions were intended to manage the firehose of output that a GPU generates.
A CPU core finds about 2% of the raw polys of a ~2017 GPU (say, a 980 or 1070 level card), so your overnight run was maybe 90 minutes worth of GPU searching. msieve does not ever default to degree 6. Also, the norm guidance doesn't work so well for deg 6- I thought you were trying to automate msieve poly select for small numbers, not run a search for the 4788 C220. size-opt for degree 6 is quite slow, what with an extra term to cycle through. |
![]() |
![]() |
![]() |
#14 |
"Ed Hall"
Dec 2009
Adirondack Mtns
5,227 Posts |
![]()
If you mean the build command for my Msieve trials, I think it was the basic:
Code:
make all ECM=1 CUDA=1 (NO_ZLIB=1 - tried with and without) |
![]() |
![]() |
![]() |
#15 |
"Curtis"
Feb 2005
Riverside, CA
2×5×563 Posts |
![]()
No, he meant the invocation you used to call msieve. We've all had empty output files unexpectedly, and oftentimes there's a typo to be found in the chain-of-flags on the command line that explains the output.
Then again, sometimes it's just too-tight norm settings! |
![]() |
![]() |
![]() |
#16 | |
"Ed Hall"
Dec 2009
Adirondack Mtns
146B16 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#17 |
"Curtis"
Feb 2005
Riverside, CA
563010 Posts |
![]()
Well, the reason we control either stage1 or stage2 norms from the command line is because msieve's defaults are from the era before GPUs, while GPUs produce 50-100x more data from stage1.
So, if you're running CPU only, I'd relax stage1 norm to half of default, or maybe even default. That should yield enough raw polys for size-opt to have useful work to do. |
![]() |
![]() |
![]() |
#18 | |
"Ed Hall"
Dec 2009
Adirondack Mtns
5,227 Posts |
![]() Quote:
Another query: I'm engaging all the threads of my machines via a script and providing the ranges via the script. I find that many ranges quit almost immediately with no results and those that continue always have the same coefficients. I thought that Msieve chooses random coefficients within the given range. Is the randomness only in the multiple of the small primes? And, does this mean if the ranges are too small, there will be no appropriate coefficients within some? I've written my script to take these skipped instances into account when assigning threads. Additionally, once Msieve has chosen a coefficient within a range, it never releases that coefficient to move to another.* Should I choose ranges based on expecting each to hold only one appropriate coefficient, perhaps 120120 (2^3*3*5*7*11*13), which has been the first coefficient for every run? I know Msieve README.nfs says each range can be run on multiple machines and the randomness will minimize collisions, maybe my understanding of randomness is(was) incorrect and two machines (threads) will work the same coefficient, but the randomness is in the work within that coefficient. Am I learning or losing it? * I'm guessing that's because of the "deadline: 8640000 CPU-seconds per coefficient" and it really would move on after a few months. |
|
![]() |
![]() |
![]() |
#19 |
"Curtis"
Feb 2005
Riverside, CA
2×5×563 Posts |
![]()
Far as I know (it has been years since I paid any attention to msieve poly select, so some of this is as vague as my memory):
Leading coeff is not randomized. Multiples of 12 at the very smallest searches, 60 often, sometimes larger. I forget if it's the larger the input size or the larger the coeff itself that determines what the msieve version of "incr" is. It also may be the case that msieve samples some property other than divisibility of small primes to filter which leading coeff's to search deeply on. On big poly select jobs, the space of second and third coeffs within a leading coeff is so large that a slice of the space of a leading coeff is searched. For C190+, there can be 30 or more slices, so many machines can work on the same coefficient with little work duplicated. |
![]() |
![]() |
![]() |
#20 |
Apr 2020
16358 Posts |
![]()
From a cursory glance of the code, it's 420 for degree 4 searches, and then it's 12 up to 120 digits, 60 for 121-200 digits, and 120120 for >200 digits.
|
![]() |
![]() |
![]() |
#21 | ||
"Ed Hall"
Dec 2009
Adirondack Mtns
522710 Posts |
![]() Quote:
Quote:
Thanks! |
||
![]() |
![]() |
![]() |
#22 |
"Ed Hall"
Dec 2009
Adirondack Mtns
146B16 Posts |
![]()
Hmm. . . I guess the random threads didn't work:
Code:
120120 442190148297076679 593919502199669884690565060176108763 120120 442190148297076679 593919502199669884690565060176108763 120120 442190148297076679 593919502199669884690565060176108763 120120 442190148297076679 593919502199669884690565060176108763 120120 442190148297076679 593919502199669884690565060176108763 120120 442190148297076679 593919502199669884690565060176108763 120120 442190148297076679 593919502199669884690565060176108763 120120 442190148297076679 593919502199669884690565060176108763 120120 442190148297076679 593919502199669884690565060176108763 120120 442190148297076679 593919502199669884690565060176108763 120120 442190148297076679 593919502199669884690565060176108763 120120 442190148297076679 593919502199669884690565060176108763 120120 442190148297076679 593919502199669884690565060176108763 120120 442190148297076679 593919502199669884690565060176108763 120120 442190148297076679 593919502199669884690565060176108763 120120 442190148297076679 593919502199669884690565060176108763 120120 442190148297076679 593919502199669884690565060176108763 120120 442190148297076679 593919502199669884690565060176108763 120120 442190148297076679 593919502199669884690565060176108763 120120 442190148297076679 593919502199669884690565060176108763 120120 442190148297076679 593919502199669884690565060176108763 120120 442190148297076679 593919502199669884690565060176108763 120120 442190148297076679 593919502199669884690565060176108763 120120 442190148297076679 593919502199669884690565060176108763 |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Msieve failed to polyselect | firejuggler | Msieve | 3 | 2018-10-01 13:47 |
Base method of montgomery polyselect implementation | csg | Homework Help | 2 | 2017-12-13 07:04 |
Playing with CADO's individual polyselect binaries | Dubslow | CADO-NFS | 22 | 2016-07-04 19:54 |
To CPU or to GPU: stage1 polyselect research | Karl M Johnson | Msieve | 8 | 2011-11-12 19:46 |
Questions | joblack | Math | 10 | 2009-05-01 19:52 |