CUDA for prime number search

Forum > Discussion Forum

<< < (4/7) > >>

_heinz:
If someone would have a closer look at llr
I found now llr download-area

heinz

_heinz:
could compile llr with VS2008 and CUDA40
1>llrcuda_win64 - 0 Fehler, 336 Warnung(en)
========== Alles neu erstellen: 1 erfolgreich, Fehler bei 0, 0 übersprungen ==========

The using of cutil.h cutil_inline.h in the project llr under CUDA40 is a bit problematic, cutil is no longer part of CUDA(since 4.0)

Jason G:
Well done Heinz. If you plan for boinc lib updates first (to fix exit conditions) then optimisation I can give more hints as time goes on.

Jason

_heinz:
I run a short test with the original llrCUDA not my compiled version on i3 GT540M
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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

9999*2^458051+1 is prime! Time : 487.041 sec.. Time per bit: 1.060 ms.

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 : 20000 / 390927 [5.11%]. Time per iteration : 1.
1000065*2^390927-1, iteration : 30000 / 390927 [7.67%]. Time per iteration : 1.
1000065*2^390927-1, iteration : 40000 / 390927 [10.23%]. Time per iteration : 1
...
...
1000065*2^390927-1, iteration : 190000 / 390927 [48.60%]. Time per iteration :
Iter: 192128/390926, ERROR: ROUND OFF (0.4675197601) > 0.4
Continuing from last save file.
Resuming LLR test of 1000065*2^390927-1 at iteration 2 [0.00%]
1000065*2^390927-1, iteration : 10000 / 390927 [2.55%]. Time per iteration : 1.
1000065*2^390927-1, iteration : 20000 / 390927 [5.11%]. Time per iteration : 1.
1000065*2^390927-1, iteration : 30000 / 390927 [7.67%]. Time per iteration : 1.
1000065*2^390927-1, iteration : 40000 / 390927 [10.23%]. Time per iteration : 1
..
..
1000065*2^390927-1, iteration : 380000 / 390927 [97.20%]. Time per iteration :
1000065*2^390927-1, iteration : 390000 / 390927 [99.76%]. Time per iteration :
1000065*2^390927-1 is not prime. LLR Res64: 5704E082C8671874 Time : 721.315 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: A3FC31A0497414EE Time : 1949.425 sec.
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
C:\I\llrCUDA.0.60-win64\llrCUDA.0.60-win64>llrCUDA.exe -q"192971*2^4998058-1" -d

Starting Lucas Lehmer Riesel prime test of 192971*2^4998058-1
Using real irrational base DWT, FFT length = 1048576
V1 = 4 ; Computing U0...
V1 = 4 ; Computing U0...done.
Starting Lucas-Lehmer loop...
192971*2^4998058-1, iteration : 10000 / 4998058 [0.20%]. Time per iteration : 2
192971*2^4998058-1, iteration : 20000 / 4998058 [0.40%]. Time per iteration : 1
192971*2^4998058-1, iteration : 30000 / 4998058 [0.60%]. Time per iteration : 1
192971*2^4998058-1, iteration : 40000 / 4998058 [0.80%]. Time per iteration : 1
...
...
192971*2^4998058-1, iteration : 2500000 / 4998058 [50.01%]. Time per iteration
192971*2^4998058-1, iteration : 2510000 / 4998058 [50.21%]. Time per iteration
192971*2^4998058-1, iteration : 2520000 / 4998058 [50.41%]. Time per iteration
192971*2^4998058-1, iteration : 2530000 / 4998058 [50.61%]. Time per iteration
...
...
192971*2^4998058-1, iteration : 4970000 / 4998058 [99.43%]. Time per iteration
192971*2^4998058-1, iteration : 4980000 / 4998058 [99.63%]. Time per iteration
192971*2^4998058-1, iteration : 4990000 / 4998058 [99.83%]. Time per iteration
192971*2^4998058-1 is not prime. LLR Res64: DBBFCB63CFBA6EA2 Time : 71172.972sec.
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
C:\I\llrCUDA.0.60-win64\llrCUDA.0.60-win64>llrCUDA.exe -q"3*2^7033641+1" -d
Starting Proth prime test of 3*2^7033641+1
Using complex irrational base DWT, FFT length = 1048576, a = 5

3*2^7033641+1, bit: 90000 / 7033642 [1.27%]. Time per bit: 14.932 ms.
..
3*2^7033641+1, bit: 2590000 / 7033642 [36.82%]. Time per bit: 14.932 ms.
3*2^7033641+1, bit: 2770000 / 7033642 [39.38%]. Time per bit: 14.931 ms.
3*2^7033641+1, bit: 4700000 / 7033642 [66.82%]. Time per bit: 14.932 ms. (20 hours)
...
3*2^7033641+1 is not prime. Proth RES64: 4DDC768A04467D4E Time : 105090.700 sec.
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

uhh, one is running about 19 hours,
next one seems to be a long runner too, precalculation says ~30 hours.....I will see the end..
Remark: GPU temp increased from 70 to 79 grd C
ready now, it was a longer test...
I will rerun the first two tasks to see differences
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Will make a modified batchfile for speed-testing variants

_heinz:

--- Quote from: Jason G on 17 Sep 2011, 06:11:42 pm ---Well done Heinz. If you plan for boinc lib updates first (to fix exit conditions) then optimisation I can give more hints as time goes on.

Jason

--- End quote ---
Hi Jason
It's a good idea to make the boinc lib updates now...
some hints, links ?

Navigation

[0] Message Index

[#] Next page

[*] Previous page

Go to full version