mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > Riesel Prime Search

Reply
 
Thread Tools
Old 2012-08-10, 05:26   #1
shanecruise
 
shanecruise's Avatar
 
Mar 2012
Hyderabad, India

3·17 Posts
Cool LLRcuda

Is anyone working with llrcuda? or any idea about gpu enabled prime search.
I need help


(OpEd: Moved from the "Post lots of primes" thread)

Last fiddled with by Kosmaj on 2012-08-15 at 06:22
shanecruise is offline   Reply With Quote
Old 2012-08-10, 06:06   #2
pinhodecarlos
 
pinhodecarlos's Avatar
 
"Carlos Pinho"
Oct 2011
Milton Keynes, UK

4,597 Posts
Default

Quote:
Originally Posted by shanecruise View Post
thanks a lot kosmaj :)

Is anyone working with llrcuda? or any idea about gpu enabled prime search.
I need help
VBCurtis is.

Pages that might me of interest:

http://www.bc-team.org/downloads.php?cat=7
http://primegrid.pytalhost.net/Mirror.htm

Edit: Sorry for the offtopic.

Last fiddled with by pinhodecarlos on 2012-08-10 at 06:12
pinhodecarlos is online now   Reply With Quote
Old 2012-08-11, 02:35   #3
VBCurtis
 
VBCurtis's Avatar
 
"Curtis"
Feb 2005
Riverside, CA

2×72×43 Posts
Default

Quote:
Originally Posted by shanecruise View Post
thanks a lot kosmaj :)

Is anyone working with llrcuda? or any idea about gpu enabled prime search.
I need help
Shane-
Indeed, I am. See the k=5 thread for my results with LLRcuda. Create a thread, or PM me, if you have any questions. Threads are wise for things other might want answers to!

In short, it's great for specific n-ranges below FFT jumps; but there are few FFT sizes, so wide ranges of n are inefficient. Also, the bigger the n the more efficient CUDA is compared to CPU testing.
-Curtis
VBCurtis is offline   Reply With Quote
Old 2012-08-11, 03:14   #4
Dubslow
Basketry That Evening!
 
Dubslow's Avatar
 
"Bunslow the Bold"
Jun 2011
40<A<43 -89<O<-88

160658 Posts
Default

Quote:
Originally Posted by VBCurtis View Post
it's great for specific n-ranges below FFT jumps; but there are few FFT sizes, so wide ranges of n are inefficient.
I don't know anything about LLRcuda, but CUDALucas (LLcuda analogously) was able to move from power-of-two-only FFT lengths to using cufft, which supports any 7-smooth length. CUDALucas is now able to (efficiently) use all the same FFT lengths as Prime95.

I can't help with actually doing it though, you'd have to ask msft for more details.
Dubslow is offline   Reply With Quote
Old 2014-09-14, 20:32   #5
pinhodecarlos
 
pinhodecarlos's Avatar
 
"Carlos Pinho"
Oct 2011
Milton Keynes, UK

4,597 Posts
Default

Is there any OpenCL LLR version?
pinhodecarlos is online now   Reply With Quote
Old 2014-09-14, 20:48   #6
kracker
ἀβουλία
 
kracker's Avatar
 
"Mr. Meeseeks"
Jan 2012
California, USA

17×127 Posts
Default

Quote:
Originally Posted by pinhodecarlos View Post
Is there any OpenCL LLR version?
Sadly, no... There is clLucas(Lucas-Lehmer) out there... but the clFFT library that drives it is quite unoptimized/inefficient compared to Nvidia's FFT library at the moment...
kracker is online now   Reply With Quote
Old 2014-09-15, 03:12   #7
LaurV
Romulan Interpreter
 
LaurV's Avatar
 
Jun 2011
Thailand

206078 Posts
Default

Let's say not that it is inefficient, but it only plays well with FFT's which are powers of two. So, if accidentally you have to do a LL for an exponent in (say) 37M, where P95 and cudaLucas would also use a 2^x FFT, then clLucas is same efficient as the other two. And so on for other ranges where the 2^x is theoretically optimal. But as long as you are LL-ing exponents for which P95 or cudaLucas would select a better FFT, non-power of two, then clLucas would either be very slow with than non-power of two FFT, or you can force it to use the next higher 2^x FFT, for which the speed can be a little faster than with the smaller non-2^x, but still far away from what P95 or cudaLucas could do, due to the fact that now the FFT is higher.

Last fiddled with by LaurV on 2014-09-15 at 03:28
LaurV is offline   Reply With Quote
Old 2014-09-15, 08:23   #8
pinhodecarlos
 
pinhodecarlos's Avatar
 
"Carlos Pinho"
Oct 2011
Milton Keynes, UK

4,597 Posts
Default

I am not worried about the inefficient because I will use the company electricity. Can you guys point me to the link of the client? I pretend to PRP riesel base 2 for k=5 at n>5M.
pinhodecarlos is online now   Reply With Quote
Old 2014-09-16, 02:09   #9
kracker
ἀβουλία
 
kracker's Avatar
 
"Mr. Meeseeks"
Jan 2012
California, USA

17·127 Posts
Default

Quote:
Originally Posted by pinhodecarlos View Post
I am not worried about the inefficient because I will use the company electricity. Can you guys point me to the link of the client? I pretend to PRP riesel base 2 for k=5 at n>5M.
Damn, I should have initially said it doesn't exist... Sorry.

The main reason why: Not worth it...
Besides, CPU's usually beat or are very close to GPU's with less power nowadays with FMA3, and that gap is especially very noticeable in lower FFT's where there is no memory bottleneck(CPU)...
kracker is online now   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
llrCUDA msft GPU Computing 359 2018-11-29 20:20
LLRCUDA - getting it to work diep GPU Computing 1 2013-10-02 12:12

All times are UTC. The time now is 13:27.

Sat Jul 11 13:27:45 UTC 2020 up 108 days, 11 hrs, 0 users, load averages: 0.89, 1.06, 1.22

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.