Forum > Discussion Forum

CUDA for prime number search

<< < (6/7) > >>

_heinz:
Rerun of those two, this time with right results

C:\I\llrCUDA.0.60-win64\llrCUDA.0.60-win64>llrCUDA.exe -q"1000065*2^390927-1" -d

Starting Lucas Lehmer Riesel prime test of 1000065*2^390927-1
Using real irrational base DWT, FFT length = 131072
V1 = 5 ; Computing U0...
V1 = 5 ; Computing U0...done.
Starting Lucas-Lehmer loop...
1000065*2^390927-1, iteration : 10000 / 390927 [2.55%].  Time per iteration : 1.
...
1000065*2^390927-1, iteration : 390000 / 390927 [99.76%].  Time per iteration :
1000065*2^390927-1 is prime!  Time : 701.721 sec.

C:\I\llrCUDA.0.60-win64\llrCUDA.0.60-win64>llrCUDA.exe -q"313*2^1012240+1" -d
Starting Proth prime test of 313*2^1012240+1
Using complex irrational base DWT, FFT length = 131072, a = 3

313*2^1012240+1 is not prime.  Proth RES64: 5FA128A9BECBCDD3  Time : 1894.073 se
c.

Pepi:
Is this some new build or "old" one? :)

Jason G:

--- Quote from: Pepi on 20 Sep 2011, 12:39:36 pm ---Is this some new build or "old" one? :)

--- End quote ---

Likely work in progress, so not even alpha yet Pepi  ;)

Pepi:
Alpha or Beta, everything shows progress :)
Hip hip huray :)
It was small step for me, but big step for my GPU :)

aaronhaviland:
On a slightly related note, I've been working with CUDALucas a bit recently, as the current devs of it over at mersenneforum.org had completely broken it as far as Linux support.
It is only for testing mersenne primes, and limited by memory to only being able to test primes up to around 2290000000-1... which would currently take about 245 days on a GTX460  (an exponent, which if my calculations are correct, would take about 19 years on a 2GHz single core CPU. The next Mersenne to win an EFF Cooperative Computing Award would be around 2336000000-1)

My fork (only builds on 64-bit Linux currently): https://github.com/ah42/CUDALucas

Navigation

[0] Message Index

[#] Next page

[*] Previous page