20110108, 18:02  #1  
Jul 2009
Tokyo
2·5·61 Posts 
llrCUDA
llrpisrc.zip convert to CUDA.
support k*2^n+1 & prime only. Quote:


20110108, 18:22  #2 
Account Deleted
"Tim Sorbera"
Aug 2006
San Antonio, TX USA
17·251 Posts 
Looks like it's significantly slower than a CPU right now:
Code:
99*2^83863+1 is prime! Time : 7.407 sec. 
20110108, 18:26  #3 
Sep 2004
2·5·283 Posts 
Corei5 750@3.6 GHz with llr3.8.4 version.
Code:
5*2^23473+1 is prime! Time : 332.759 ms. 11*2^18759+1 is prime! Time : 167.324 ms. 99*2^83863+1 is prime! Time : 4.739 sec. 21*2^94801+1 is prime! Time : 5.356 sec. 39*2^113549+1 is prime! Time : 7.782 sec. Last fiddled with by em99010pepe on 20110108 at 18:27 
20110108, 19:11  #4 
A Sunny Moo
Aug 2007
USA (GMT5)
3×2,083 Posts 
Awesome! Gary and I are still working to get his GPU functioning again...we've been running into some strange issues with driver config on Ubuntu 10.04, but will hopefully be able to get it working soon. As soon as we do, I'm open to help with any testing that's needed. 
20110108, 19:32  #5 
Sep 2004
2830_{10} Posts 
msft,
Please make a test with bigger numbers: 5*2^1282755+1 5*2^1320487+1 
20110108, 22:23  #6  
Oct 2010
191 Posts 
Quote:
First impression: ralf@quadriga ~/llrcuda.0.07 $ time ./llrCUDA q"5*2^1282755+1" d Starting Proth prime test of 5*2^1282755+1, FFTLEN = 131072 ; a = 3 5*2^1282755+1, bit: 20000 / 1282757 [1.55%]. Time per bit: 2.113 ms. Quick comparison: Time per bit on the CPU: ~0.812 ms. CPU Result (LLR 3.8.4): ralf@quadriga ~ $ time sllr q"5*2^1282755+1" d Resuming Proth prime test of 5*2^1282755+1 at bit 20876 [1.62%] 5*2^1282755+1 is prime! Time : 1041.208 sec. real 17m4.170s user 17m2.276s sys 0m1.640s I've accidently interrupted the CPU run. The first 1.62% took: real 0m17.266s user 0m17.113s sys 0m0.028s so you need to add ca. 17 seconds to the 1041 seconds above... Last fiddled with by Ralf Recker on 20110108 at 22:52 

20110108, 23:06  #7 
Oct 2010
191_{10} Posts 
OK. Here is the result from the GPU (details above):
ralf@quadriga ~/llrcuda.0.07 $ time ./llrCUDA q"5*2^1282755+1" d Starting Proth prime test of 5*2^1282755+1, FFTLEN = 131072 ; a = 3 5*2^1282755+1 is prime! Time : 2708.763 sec. real 45m8.793s user 45m2.749s sys 0m5.644s Edit: A version compiled with arch=sm_21 is slower (2.155 ms per bit), a version compiled with arch=sm_20 is a tiny bit faster (2.085 ms per bit). Last fiddled with by Ralf Recker on 20110108 at 23:32 
20110108, 23:40  #8 
Sep 2004
5416_{8} Posts 
Ralf Recker,
First of all thank you. Second, can you post the specs of your machine (memory, harddrives, DVDR, etc)? I want to make some calculations about energy efficiency so I need to know how many and type of components you have on it to make an energy consumption estimate. 
20110109, 00:34  #9 
Jul 2009
Tokyo
2×5×61 Posts 
GTX460:
5*2^1282755+1 is prime! Time : 4491.564 sec. 5*2^1320487+1 is prime! Time : 4447.951 sec. 
20110109, 02:17  #10  
Jul 2009
Tokyo
2×5×61 Posts 
Fix abort with non prime.
Quote:


20110109, 09:49  #11 
May 2004
FRANCE
2^{3}·3·23 Posts 
Very interesting work!
Hi,
First, Best wishes to you for an happy new year, and many congrats for this work! Indeed, I am very interested in your attempts, although I have presently neither hardware nor software to develop my code with CUDA... However, I am now working on a new version of llrpi, which is no more limited to IBDWT and small k's : it works with zeropadded FFT for k's from 22 to 45 bits large, and generic modular reduction for larger k's. Moreover, the portable "gwpnum" code is written as a library, like the George Woltman's "gwnum" one. It seems to work fine for k*2^n+1 and k*2^1 numbers (and using generic reduction for more general ones), so, I shall release the new source shortly. Best Regards, Jean 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
LLRcuda  shanecruise  Riesel Prime Search  8  20140916 02:09 
LLRCUDA  getting it to work  diep  GPU Computing  1  20131002 12:12 