![]() |
|
|
#12 |
|
Jul 2013
3×5 Posts |
actually i cant change 'msieve' to whatever because it gives error it cant find the program named '....' so i have to rename the program itself to msieve
|
|
|
|
|
|
#13 |
|
Mar 2007
Germany
23·3·11 Posts |
I give you a example how my Line 59-61 are looking.
Code:
# Set binary directory paths GGNFS_PATH = 'D:/programme/faktorisierung/lasieve4_win/lasieve4_westmere/' MSIEVE_PATH = 'D:/programme/faktorisierung/msieve/' Regards Andi_HB |
|
|
|
|
|
#14 |
|
Jul 2013
3×5 Posts |
NOW it WORKS with CUDA :))
Thanks MR.JASONP very much i really appreciate your help thanks Mr.wombatman , Mr.Brian Gladman and Mr.Andi_HB... now i can go further with my very large integer factorization problem :) Last fiddled with by mohamed on 2013-07-27 at 09:47 |
|
|
|
|
|
#15 |
|
Jul 2013
3×5 Posts |
I have another question ,
- if i have two CUDA cards in my computer , could i use them both to faster the factorization process or it only uses one of them ? -if yes how could i do that ? |
|
|
|
|
|
#16 |
|
Tribal Bullet
Oct 2004
3,541 Posts |
How large is very large? These tools cannot solve problems larger than about 170 digits; beyond that point you will have to run the binaries manually and you will need many machines.
If you have two GPUs, you can use them both for polynomial selection by passing '-g 0' to the first Msieve and '-g 1' to the second Msieve, then manually combining their results. The script cannot do this for you though. |
|
|
|
|
|
#17 |
|
Jul 2013
3×5 Posts |
okay, but could you explain how to combine the results from the 2 runs ?
about large ,, I have to go as further as possible, something like finding the best that CUDA can do .. |
|
|
|
|
|
#18 |
|
"Curtis"
Feb 2005
Riverside, CA
4,861 Posts |
You don't really combine anything from the two runs- you simply keep the best polynomial. Read the polynomial selection threads in this forum for details about exactly what commands to issue to msieve. You'll want to have each copy output to a different file, to prevent one from overwriting the other.
Since you haven't said how big your very big factorization is, it's hard to give you more detailed advice. |
|
|
|
|
|
#19 |
|
Apr 2010
Over the rainbow
23×52×13 Posts |
to give you an idea:
A modern CPU and working on 3 core-one computer-. a C110-C115 is a matter of 2 or 3 hours, a C115-C120 half a day; C120-C125 a day, C125-C130 two to three day, C130-C135 a week... roughly doubling the time for 5 or 6 digits. |
|
|
|
|
|
#20 |
|
Jan 2013
109 Posts |
With both cores of my Core i5 (64-bit ASM siever), a GNFS 125 job takes a day, and a GNFS 135 job takes 3 days (poly selection time included).
|
|
|
|
|
|
#21 |
|
Jul 2013
3×5 Posts |
Thanks Guys,
If i could solve an integer of 150 digits, it would be more than enough. any recommended threads to read ? i have tried 100 digit number but it crashes .. i am running it now again and i will post the error message here if it pops again. |
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| error when running msieve 1.53 with cuda | aein | Msieve | 9 | 2019-02-25 14:09 |
| Can anyone help me about msieve 1.53 with CUDA? | Seto | Msieve | 8 | 2016-09-24 12:54 |
| Help with msieve CUDA (C1060) | toorandom | Msieve | 7 | 2012-11-28 17:37 |
| Do I have CUDA running? | jasong | GPU Computing | 5 | 2012-11-28 00:36 |
| CUDA_ERROR_LAUNCH_OUT_OF_RESOURCES when running msieve 1.5.0 with CUDA | ryanp | Msieve | 3 | 2012-06-12 03:27 |