Thread: llrCUDA
View Single Post
Old 2011-01-08, 22:23   #6
Ralf Recker
 
Ralf Recker's Avatar
 
Oct 2010

191 Posts
Default

Quote:
Originally Posted by em99010pepe View Post
msft,

Please make a test with bigger numbers:

5*2^1282755+1
5*2^1320487+1
Just started the first one on my lowly GTX 460 (MSI factory overclocked @725 MHz, 64 Bit Linux, compiled with the CUDA 3.1 toolkit, Driver version 256.53) and on a Core of a Q9550 @ 3.6 GHz... results follow...

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 2011-01-08 at 22:52
Ralf Recker is offline   Reply With Quote