![]() |
![]() |
#1 |
"Vincent"
Apr 2010
Over the rainbow
22·7·103 Posts |
![]()
6 GB of non-shared memory mean decent P-1 power, right?
|
![]() |
![]() |
![]() |
#2 |
"Vincent"
Apr 2010
Over the rainbow
22×7×103 Posts |
![]()
to **** with it. i'll try something, but it will be unclever, slow, and useless at first.
|
![]() |
![]() |
![]() |
#3 |
If I May
"Chris Halsall"
Sep 2002
Barbados
2×5,531 Posts |
![]() |
![]() |
![]() |
![]() |
#4 | |
Banned
"Luigi"
Aug 2002
Team Italia
12F916 Posts |
![]() Quote:
I have the second, but I'm afraid I can reach a decent efficiency using montgomery multiplication... What I need is how to apply the FFT multiplication routines to the code. Yes, I'm dreaming about coding something myself... Firejuggler, if you like you may share your ideas with us. We could open a dedicated thread on how to design a GPU-enabled P-1 program (and invite people with experience...). What do you think? ![]() ![]() ![]() ![]() Luigi |
|
![]() |
![]() |
![]() |
#5 |
"Vincent"
Apr 2010
Over the rainbow
22·7·103 Posts |
![]()
please note : I have a lot of free time, and a less than average programming capacity...
the important part being lot of free time. Last fiddled with by firejuggler on 2013-02-20 at 19:43 |
![]() |
![]() |
![]() |
#6 | |
Banned
"Luigi"
Aug 2002
Team Italia
3×1,619 Posts |
![]() Quote:
If you have freetime, I'd like to have links of different, working, easy to read P-1 programs... Luigi Last fiddled with by ET_ on 2013-02-20 at 19:47 Reason: Answering to Firejuggler's edit. |
|
![]() |
![]() |
![]() |
#7 |
Basketry That Evening!
"Bunslow the Bold"
Jun 2011
40<A<43 -89<O<-88
3·29·83 Posts |
![]()
Using CUDALucas' FFT/mul code would be a good place to start. I believe there is also other work being done on this particular front of the GPU P-1 issue.
|
![]() |
![]() |
![]() |
#8 |
If I May
"Chris Halsall"
Sep 2002
Barbados
254668 Posts |
![]() |
![]() |
![]() |
![]() |
#9 |
Basketry That Evening!
"Bunslow the Bold"
Jun 2011
40<A<43 -89<O<-88
722110 Posts |
![]()
Nope.
I did just double check that I was remembering correctly, and I was. One more knowledgeable than I in such large-number arithmetic on GPUs has "been thinking about p-1 on gpus". I don't know if that's going anywhere though. |
![]() |
![]() |
![]() |
#10 |
Banned
"Luigi"
Aug 2002
Team Italia
12F916 Posts |
![]()
I've been thinking about a CUDA program for P-1 factoring for quite a bit, and think that many other Mersennaries had.
First of all, note that I have only a limited knowledge about the math involved, but I'm willing to expand this limitation studying under the guide of more informed people, and eventually start coding something with the ir help. I'd like to gather ideas about how such a program should be designed. Some questions will be trivial, some other maybe deeper, but all of them will be enclosed in this thread. Some naif subjects to talk about: - Parallelization of tasks - Limitations due to the memory factor of the GPU (how far may we go having 0.5, 1, 2,3 or 6GB of memory? - Limitations of the GPU shared memory. - Description of steps 1 and 2 (from MersenneWiki I got a grasp of it, but a talk would explain more). - use of streams to pass chunks of bytes to analyze. - How to apply CuFFT library to the algorithm. - Is a parallel Montgomery multiplication algorithm out of question for such algorithm? I hope it may help both people in need for a CUDA P-1 program, programmers, mathematicians. Luigi |
![]() |
![]() |
![]() |
#11 | |
Banned
"Luigi"
Aug 2002
Team Italia
3·1,619 Posts |
![]() Quote:
Luigi |
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
mfaktc: a CUDA program for Mersenne prefactoring | TheJudger | GPU Computing | 3622 | 2023-01-25 16:41 |
World's second-dumbest CUDA program | fivemack | Programming | 112 | 2015-02-12 22:51 |
World's dumbest CUDA program? | xilman | Programming | 1 | 2009-11-16 10:26 |
Factoring program need help | Citrix | Lone Mersenne Hunters | 8 | 2005-09-16 02:31 |
Factoring program | ET_ | Programming | 3 | 2003-11-25 02:57 |