![]() |
|
|
#1 |
|
Bamboozled!
"πΊππ·π·π"
May 2003
Down not across
10,753 Posts |
I'll be investigating further, but if anyone has any ideas to short circuit it ...
Code:
pcl@maat ~/msieve/trunk/fac $ ../msieve -np -i w3_621.n deadline: 400 CPU-seconds per coefficient coeff 12 specialq 1 - 19171315 other 8002 - 19207 error (line 734): unexpected error pcl@maat ~/msieve/trunk/fac $ tail -16 msieve.log Sun Dec 15 18:00:19 2013 Msieve v. 1.52 (SVN 956) Sun Dec 15 18:00:19 2013 random seeds: 43e1a3b7 342cd8f7 Sun Dec 15 18:00:19 2013 factoring 686576626044476447828739679360983394818886834910307572215033151362313366218819423561586972940254871463193639906413334652671424206383019103791825401 (147 digits) Sun Dec 15 18:00:20 2013 no P-1/P+1/ECM available, skipping Sun Dec 15 18:00:20 2013 commencing number field sieve (147-digit input) Sun Dec 15 18:00:20 2013 commencing number field sieve polynomial selection Sun Dec 15 18:00:20 2013 polynomial degree: 5 Sun Dec 15 18:00:20 2013 max stage 1 norm: 3.17e+22 Sun Dec 15 18:00:20 2013 max stage 2 norm: 4.81e+20 Sun Dec 15 18:00:20 2013 min E-value: 6.57e-12 Sun Dec 15 18:00:20 2013 poly select deadline: 491470 Sun Dec 15 18:00:20 2013 time limit set to 136.52 CPU-hours Sun Dec 15 18:00:20 2013 expecting poly E from 7.90e-12 to > 9.09e-12 Sun Dec 15 18:00:20 2013 searching leading coefficients from 1 to 7323407 Sun Dec 15 18:00:20 2013 using GPU 0 (Quadro FX 1700) Sun Dec 15 18:00:20 2013 selected card has CUDA arch 1.1 pcl@maat ~/msieve/trunk/fac $ Paul |
|
|
|
|
|
#2 |
|
Apr 2010
Over the rainbow
23·52·13 Posts |
Doesn't the lasts version require a 2.0 cuda arch?
Last fiddled with by firejuggler on 2013-12-15 at 18:39 |
|
|
|
|
|
#3 |
|
Bamboozled!
"πΊππ·π·π"
May 2003
Down not across
10,753 Posts |
|
|
|
|
|
|
#4 |
|
Tribal Bullet
Oct 2004
DD516 Posts |
Polynomial selection can still use a capability 1.1 card; unfortunately one of the kernels uses an atomic operation that disqualifies use of 1.0 cards.
How much memory does the card have? |
|
|
|
|
|
#5 |
|
Bamboozled!
"πΊππ·π·π"
May 2003
Down not across
101010000000012 Posts |
|
|
|
|
|
|
#6 |
|
Tribal Bullet
Oct 2004
3,541 Posts |
That could be the problem; the code tries to use at most 30% of the on-card memory, or a max of about 300M, whichever comes first.
Another possibility is that the maximum size of a kernel launch is more restricted for capability < 2.0, and the code could be silently violating that. |
|
|
|
|
|
#7 | |
|
Bamboozled!
"πΊππ·π·π"
May 2003
Down not across
250018 Posts |
Quote:
Paul |
|
|
|
|
|
|
#8 |
|
"Ed Hall"
Dec 2009
Adirondack Mtns
11·347 Posts |
Am I having a similar or entirely different failure? I have 1024 MB:
Code:
MPI process 0 of 1 factoring 68482425847675570595542326599064126332924657356117138067976231353171490880041876507923980473551830545978048235812132484593056452451287 (134 digits) searching for 15-digit factors commencing number field sieve (134-digit input) commencing number field sieve polynomial selection polynomial degree: 5 max stage 1 norm: 2.23e+20 max stage 2 norm: 4.75e+18 min E-value: 3.55e-11 poly select deadline: 98277 time limit set to 27.30 CPU-hours expecting poly E from 4.86e-11 to > 5.59e-11 searching leading coefficients from 1 to 1639297 using GPU 0 (Quadro FX 880M) selected card has CUDA arch 1.2 deadline: 200 CPU-seconds per coefficient coeff 12 specialq 1 - 1490691 other 4027 - 9666 error (line 734): unexpected error Msieve Error: return value 255. Is CUDA enabled? Terminating... |
|
|
|
|
|
#9 |
|
Tribal Bullet
Oct 2004
1101110101012 Posts |
If those two MPI processes are on the same machine then they will overwrite each other's output files. MPI polynomial selection has never been tested, so try a non-MPI binary to remove one potential source of trouble.
|
|
|
|
|
|
#10 | |
|
"Ed Hall"
Dec 2009
Adirondack Mtns
11×347 Posts |
Quote:
![]() I recompiled without MPI and without change: Code:
Msieve v. 1.52 (SVN 956) Fri Jan 10 10:33:06 2014 random seeds: 9f4e89db 24e94162 factoring 58056616587745511771680421207297639376513580077124191292534786503244595213334531384547593301 (92 digits) searching for 15-digit factors commencing number field sieve (92-digit input) commencing number field sieve polynomial selection polynomial degree: 4 max stage 1 norm: 4.70e+15 max stage 2 norm: 6.39e+14 min E-value: 2.74e-08 poly select deadline: 778 time limit set to 0.22 CPU-hours expecting poly E from 4.32e-08 to > 4.97e-08 searching leading coefficients from 1 to 14786534 using GPU 0 (Quadro FX 880M) selected card has CUDA arch 1.2 deadline: 5 CPU-seconds per coefficient coeff 12 specialq 1 - 299020 other 930 - 2232 error (line 734): unexpected error Although msieve compiled, is it possible this is a CUDA library linking issue? I was not totally clear with that section of my install... Thanks for any help... |
|
|
|
|
|
|
#11 |
|
I moo ablest echo power!
May 2013
29×61 Posts |
Because I'm having a CUDA problem as well with Revision 956, I figured I would add on to here.
If I compile without CUDA (i.e., WIN=1 ECM=1), it works fine. If I compile with CUDA, however, running msieve generates a c0000005 exception code when it tries to start the polynomial search. OS is Windows 7 Ultimate 64-bit. -march flag is corei7 and CUDA is V5.5. Again, MSieve compiles without error in MinGW64, but throws the exception when I try to actually run it--but only when compiled with CUDA. Any help is greatly appreciated. |
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Assertion failure in 6.4.2 | bsquared | GMP-ECM | 4 | 2013-03-01 15:52 |
| Which poly to use? | Karl M Johnson | Msieve | 29 | 2010-06-09 02:51 |
| LA Failure | R.D. Silverman | NFSNET Discussion | 10 | 2007-05-23 21:53 |
| What does this failure indication mean? | krunsj | Hardware | 5 | 2004-07-17 16:09 |
| Failure Functioins | Unregistered | Miscellaneous Math | 0 | 2004-02-12 11:51 |