Forum > Discussion Forum
CUDA for prime number search
Pepi:
Thanks :)
aaronhaviland:
I'm pretty sure llrcuda is 64-bit due to the sheer size of the numbers they are dealing with. Even then, the app cannot deal with mersenne primes of the size that would qualify for the next EFF Cooperative Computing Award (100,000,000 digits).
Also, I believe that given a relatively recent CPU and GPU, it is still much slower on the GPU. It is *very*heavily* bound in cufft.
It's been more than a few months since I've looked that way. I had been meaning to look more closely at llrcuda before I dropped off the face of the planet a couple months ago...
The main developer for llrcuda is "msft" on mersenneforum.org. Someone else is doing the boinc-ification...
Pepi:
I know that GPU cannot be faster on any project that BOINC run, beside GPU is even now faster then CPU on some primes search, but compared to other BOINC project advantage is minimal. When you get power consumption of GPU and CPU then CPU is still better and cheaper way to find prime ( and works on all prime projects)
And for 32 or 64 bit , CPU also must have deal with big number, but all applications are 32 bits, even 64 bit host get 32 bit app. So it looks that 32 bit CUDA app will be ok ?
Jason G:
Lets see what Heinz says. He's a busy man & has multiple exploded computers right now, But I think his interest does lie there & will happily take advice & technology from here & apply it to other projects, if it helps spread 'not-breaking-seti-ness' (technical term) .
_heinz:
Hi,
I run primegrid and compiled ppsieve-source with ICC already some time ago.
llrcuda I have not tried till now.
A year ago I compiled a Collatz client with ICC too.
I have done this to study source and testing CUDA and ICC.
If I get some support from Jason I can do the boinc-part changes as it is done in seti already.
I'm very busy, so I can do it as soon I have time.
heinz
Navigation
[0] Message Index
[#] Next page
[*] Previous page
Go to full version