![]() |
|
|
#12 |
|
Tribal Bullet
Oct 2004
354110 Posts |
Do you see results accumulating in msieve.dat.p? If yes then you are using your card already, and the code automatically scales up or down the work that is given to the card based on how nice it is. There should be a fair amount of output as intermediate results get found, but the python script may be hiding that.
You can get noticeably higher throughput with problems this size by using more than one thread to feed the card (add -t 2 and see if the frequency of results increases). Otherwise you can only fiddle with polynomial selection parameters that require a fair amount of expertise to use. Last fiddled with by jasonp on 2013-06-14 at 15:00 |
|
|
|
|
|
#13 |
|
Apr 2010
Over the rainbow
1010001010002 Posts |
did you try with -g 0?
|
|
|
|
|
|
#14 |
|
Jun 2013
32 Posts |
|
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Detecting bigInt roots | mathPuzzles | Computer Science & Computational Number Theory | 9 | 2017-07-01 03:35 |
| problem with my PC | science_man_88 | Software | 1 | 2011-01-31 21:40 |
| Msieve not detecting L3 cache | 10metreh | Msieve | 8 | 2010-10-26 01:42 |
| Detecting arithmetic progressions | grandpascorpion | Math | 18 | 2007-03-28 15:08 |
| 51 problem | Neves | Miscellaneous Math | 5 | 2004-02-10 22:59 |