![]() |
|
|
#1 |
|
May 2003
111110002 Posts |
C110, older Pentium M processor (1.6GHz), no CUDA, running polynomial selection for about 24 hours so far.
Is something wrong? And how would I know? |
|
|
|
|
|
#2 | |
|
Romulan Interpreter
Jun 2011
Thailand
258B16 Posts |
Quote:
You can try to find a better and better poly, for years, if you like... (well... is not so efficient...)For a comparison: Single core time for a C110 in the factor.log file of yafu (which uses msieve for poly selection) is set to about 3400 seconds (I used 1 core of a Core2Duo CPU to check just now). So, most probably, you have already a very good poly. ![]() Advice: if msieve looks complicate for you, try using yafu for a while. It does the most of the things for you, it is much easier for a start. |
|
|
|
|
|
|
#3 |
|
Tribal Bullet
Oct 2004
3,541 Posts |
The development version of Msieve has a fix for a bug that messes up the calculation of elapsed time in Windows; v1.51 unfortunately does not have the fix.
|
|
|
|
|
|
#4 |
|
"Ed Hall"
Dec 2009
Adirondack Mtns
11×347 Posts |
If you are still using factmsieve.py, you can set:
... USE_CUDA = False GPU_NUM = 0 MSIEVE_POLY_TIME_LIMIT = 0 ... to a hard time in minutes. (0 means to use msieve's timing.) But, I would first look in the .log file to see how long msieve wants to search. It will say something like: poly select deadline: 15264 time limit set to 4.24 CPU-hours The 15264 is CPU-seconds |
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| very long int | davar55 | Lounge | 60 | 2013-07-30 20:26 |
| How long until annihilation? | Zeta-Flux | Soap Box | 26 | 2011-10-19 00:51 |
| Using long long's in Mingw with 32-bit Windows XP | grandpascorpion | Programming | 7 | 2009-10-04 12:13 |
| I think it's gonna be a long, long time | panic | Hardware | 9 | 2009-09-11 05:11 |
| How long is too long? | schickel | Lounge | 2 | 2009-02-22 12:31 |