+- +-
Say hello if visiting :) by Gecko
11 Jan 2023, 07:43:05 pm

Seti is down again by Mike
09 Aug 2017, 10:02:44 am

Some considerations regarding OpenCL MultiBeam app tuning from algorithm view by Raistmer
11 Dec 2016, 06:30:56 am

Loading APU to the limit: performance considerations by Mike
05 Nov 2016, 06:49:26 am

Better sleep on Windows - new round by Raistmer
26 Aug 2016, 02:02:31 pm

Author Topic: CUDA for prime number search  (Read 31083 times)

Offline ML1

  • Porting Team
  • Squire
  • *****
  • Posts: 30
Re: CUDA for prime number search
« Reply #30 on: 10 Oct 2011, 08:48:59 pm »
... 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) ...
Ouch... Too late in the night for counting all those exponent digits... It is moving somewhat when you need exponents to sensibly express the exponents!

Quite a nice speedup there for the GPU to CPU comparison  ;D

Aside: I hit a RAC of over 200k on a test run with Boinc-GIMPS on my GTS450.

Happy fast crunchin',
Martin

 

Welcome, Guest.
Please login or register.
 
 
 
Forgot your password?
Members
Total Members: 97
Latest: ToeBee
New This Month: 0
New This Week: 0
New Today: 0
Stats
Total Posts: 59559
Total Topics: 1672
Most Online Today: 40
Most Online Ever: 983
(20 Jan 2020, 03:17:55 pm)
Users Online
Members: 0
Guests: 36
Total: 36
Powered by EzPortal