mersenneforum.org  

Go Back   mersenneforum.org > Great Internet Mersenne Prime Search > Hardware > GPU Computing

Reply
 
Thread Tools
Old 2011-09-16, 13:20   #1
Cruelty
 
Cruelty's Avatar
 
May 2005

2×809 Posts
Default non base=2 GPU sieving?

Is there any software or plans to develop one that enables such a sieve on a GPU?
I am sure I have read about it somewhere but I cannot find it now
Cruelty is offline   Reply With Quote
Old 2011-09-16, 20:31   #2
Christenson
 
Christenson's Avatar
 
Dec 2010
Monticello

5×359 Posts
Default

mfaktc is in the wishlist stage of moving the sieve to the GPU. wblipp asked if mfaktc could look at Riesel numbers; this is also at the wishlist stage.
Christenson is offline   Reply With Quote
Old 2011-09-21, 15:01   #3
Ken_g6
 
Ken_g6's Avatar
 
Jan 2005
Caught in a sieve

2×197 Posts
Default

I've posted about my plan before: re-implement a fixed-K sieve with Pollard's rho algorithm for logarithms. Done right, that should work for different bases as well.

On the other hand, I have no plans to implement this, and I don't know of anyone else who's taken up the cause.
Ken_g6 is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Sieving Drive all base 2/4 k's worked by CRUS gd_barnes Conjectures 'R Us 143 2014-10-21 23:55
Sieving drive Riesel base 6 n=1M-2M gd_barnes Conjectures 'R Us 40 2011-01-22 08:10
Base-6 speed for prime testing vs. base-2 jasong Conjectures 'R Us 36 2010-08-03 06:25
Sieving Riesel & Sierp base 16 gd_barnes Conjectures 'R Us 13 2009-12-14 09:23
Sieving drive Riesel base 6 n=150K-1M gd_barnes Conjectures 'R Us 27 2009-10-08 21:49

All times are UTC. The time now is 18:04.

Sat Dec 5 18:04:38 UTC 2020 up 2 days, 14:15, 0 users, load averages: 2.01, 2.38, 2.34

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.