![]() |
![]() |
#1 |
May 2008
Worcester, United Kingdom
72·11 Posts |
![]()
I have just added a Visual Studio 2010 build for the GPU stage 1 code on Windows x64 to the SVN (it might work on win32 but I have not tested it).
As Paul L has already said, this code is only for those who are brave (or foolhardy) since it requires that the project build properties in Visual Studio are properly set up for your GPU configuration before it is built. Please seek advice, discuss or report issues here. Brian Gladman |
![]() |
![]() |
![]() |
#2 | |
"Nathan"
Jul 2008
Maryland, USA
5·223 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#3 |
Mar 2010
19B16 Posts |
![]()
It's for ecm from GMP-ECM package.
Last fiddled with by Karl M Johnson on 2012-02-18 at 05:56 |
![]() |
![]() |
![]() |
#4 |
Just call me Henry
"David"
Sep 2007
Liverpool (GMT/BST)
37·163 Posts |
![]() |
![]() |
![]() |
![]() |
#5 |
Account Deleted
"Tim Sorbera"
Aug 2006
San Antonio, TX USA
10B716 Posts |
![]() |
![]() |
![]() |
![]() |
#6 |
Just call me Henry
"David"
Sep 2007
Liverpool (GMT/BST)
10111100011112 Posts |
![]() |
![]() |
![]() |
![]() |
#7 |
Tribal Bullet
Oct 2004
32·5·79 Posts |
![]()
Yes, if you have to do batch factorization of many different numbers then a GPU would work nicely, but you will need separate state for each number. In fact there's a cottage industry within the number field sieve community to work out a method where many bazillions of small numbers, maybe 80-150 bits each, can get factored with ECM and P+-1. This is the 'NFS cofactorization problem' and graphics cards look like an ideal way to solve it. They're much cheaper and possibly much faster than FPGAs, and programming them is a snap with modern toolkits so you don't need to know any hardware design.
|
![]() |
![]() |
![]() |
#8 |
Oct 2007
6A16 Posts |
![]()
Some interesting developments as of yesterday:
Improved addition chains for Edward's curve ECM: http://eprint.iacr.org/2012/089 and More ECM-friendly curve families: http://eprint.iacr.org/2012/070 |
![]() |
![]() |
![]() |
#9 |
Feb 2004
2×3×43 Posts |
![]()
The build.vc11 gpu project file seems outdated and no longer works. I did some changes to it and managed to get gmp-ecm svn2518 to build and run with gpu support using VS 2012 Express and CUDA 5.0 on win7 x64.
I've put the updated files and what I hope are sufficient instructions to get things working at http://mklasson.com/gmp-ecm_70dev_gpu_vc11.zip. If you're only looking for binaries you can try my x64 i7 executables: http://mklasson.com/gmp-ecm_gpu_70de...7_sm20_x64.zip http://mklasson.com/gmp-ecm_gpu_70de...7_sm30_x64.zip My 660 Ti card seems about as fast as all four cores of my 3.6GHz i7. Many thanks to Brian, Cyril, and the other fellows behind the scenes! |
![]() |
![]() |
![]() |
#10 |
Romulan Interpreter
"name field"
Jun 2011
Thailand
101000001010012 Posts |
![]() |
![]() |
![]() |
![]() |
#11 | |
Feb 2004
2·3·43 Posts |
![]() Quote:
![]() My 660 Ti is about 12x the speed of one 3.6GHz i7 core on a c295 input. And see http://www.mersenneforum.org/showpos...5&postcount=89 for a stage2 bug workaround. |
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
I'm trying to speedup AES MSIEVE factoring using CUDA build but... | loopdemack | Msieve | 11 | 2016-01-18 13:44 |
32-bit CUDA build? | f1pokerspeed | Msieve | 2 | 2013-12-30 01:14 |
Windows x64 CUDA Build | Brian Gladman | Msieve | 12 | 2013-08-30 12:40 |
CUDA executable code | nucleon | GPU Computing | 4 | 2013-02-04 22:44 |
need C/C++ modular arithmetic code for Windows | ixfd64 | Programming | 15 | 2008-07-30 03:52 |