20130220, 18:52  #1 
Apr 2010
Over the rainbow
2^{2}×5×127 Posts 
The P1 factoring CUDA program
6 GB of nonshared memory mean decent P1 power, right?

20130220, 19:29  #2 
Apr 2010
Over the rainbow
9EC_{16} Posts 
to **** with it. i'll try something, but it will be unclever, slow, and useless at first.

20130220, 19:35  #3 
If I May
"Chris Halsall"
Sep 2002
Barbados
9,533 Posts 
Plans for a P1 factoring CUDA program

20130220, 19:40  #4  
Banned
"Luigi"
Aug 2002
Team Italia
11314_{8} 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 GPUenabled P1 program (and invite people with experience...). What do you think? Luigi 

20130220, 19:41  #5 
Apr 2010
Over the rainbow
2^{2}·5·127 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 20130220 at 19:43 
20130220, 19:45  #6  
Banned
"Luigi"
Aug 2002
Team Italia
2^{2}·3·401 Posts 
Quote:
If you have freetime, I'd like to have links of different, working, easy to read P1 programs... Luigi Last fiddled with by ET_ on 20130220 at 19:47 Reason: Answering to Firejuggler's edit. 

20130220, 20:02  #7 
Basketry That Evening!
"Bunslow the Bold"
Jun 2011
40<A<43 89<O<88
16065_{8} 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 P1 issue.

20130220, 20:07  #8 
If I May
"Chris Halsall"
Sep 2002
Barbados
9,533 Posts 

20130220, 20:13  #9 
Basketry That Evening!
"Bunslow the Bold"
Jun 2011
40<A<43 89<O<88
1C35_{16} Posts 
Nope.
I did just double check that I was remembering correctly, and I was. One more knowledgeable than I in such largenumber arithmetic on GPUs has "been thinking about p1 on gpus". I don't know if that's going anywhere though. 
20130220, 20:30  #10 
Banned
"Luigi"
Aug 2002
Team Italia
2^{2}·3·401 Posts 
Plans for a P1 factoring CUDA program
I've been thinking about a CUDA program for P1 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 P1 program, programmers, mathematicians. Luigi 
20130220, 20:31  #11  
Banned
"Luigi"
Aug 2002
Team Italia
2^{2}×3×401 Posts 
Quote:
Luigi 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
mfaktc: a CUDA program for Mersenne prefactoring  TheJudger  GPU Computing  3492  20210324 14:09 
World's seconddumbest CUDA program  fivemack  Programming  112  20150212 22:51 
World's dumbest CUDA program?  xilman  Programming  1  20091116 10:26 
Factoring program need help  Citrix  Lone Mersenne Hunters  8  20050916 02:31 
Factoring program  ET_  Programming  3  20031125 02:57 