mersenneforum.org  

Go Back   mersenneforum.org > New To GIMPS? Start Here! > Information & Answers

Reply
 
Thread Tools
Old 2010-09-20, 21:10   #1
Unregistered
 

72 Posts
Default BOINC

Has GIMPS ever considered adding itself to the BOINC project, http://boinc.berkeley.edu/index.php ?
  Reply With Quote
Old 2010-09-21, 00:29   #2
Unregistered
 

2×1,361 Posts
Default

That'll open a whole new can of worms:

http://www.mersenneforum.org/showthread.php?t=13901
  Reply With Quote
Old 2010-09-21, 00:50   #3
Uncwilly
6809 > 6502
 
Uncwilly's Avatar
 
"""""""""""""""""""
Aug 2003
101×103 Posts

236068 Posts
Default

Please look at these.

http://www.mersenneforum.org/showpost.php?p=67753

http://www.mersenneforum.org/showthread.php?t=2639
Uncwilly is online now   Reply With Quote
Old 2010-09-21, 01:49   #4
mdettweiler
A Sunny Moo
 
mdettweiler's Avatar
 
Aug 2007
USA (GMT-5)

3·2,083 Posts
Default

BOINC has come a long way since those posts were made. However, the fact does remain that Prime95 is not easily adaptable to BOINC, since it is tightly integrated with the PrimeNet server.

The somewhat closely related LLR has been successfully ported to BOINC by PrimeGrid, who's been using it for the last number of years with great success. Since a BOINC server is a major pain to run, they've served as a central umbrella under which a lot of mersenneforum non-BOINC projects have gone BOINC alongside their other participation options. If GIMPS ever decided to go BOINC, the easiest route would probably be to do so through PrimeGrid.

It might be easiest to write a BOINC LL testing application based on ntprime, instead of Prime95. Just strip out the PrimeNet code and have it accept exponents to test on the command line, have it write % progress to a simple text file instead of to the console, and boom, you're all set. A wrapper program to handle communication with BOINC can be pretty easily written from there.
mdettweiler is offline   Reply With Quote
Old 2010-09-21, 01:59   #5
frmky
 
frmky's Avatar
 
Jul 2003
So Cal

222310 Posts
Default

It would also be quite easy to create a CUDA BOINC client for cards with DP support from msft's code. That would attract significant interest from BOINC users. But, of course, this all requires George's endorsement.
frmky is offline   Reply With Quote
Old 2010-09-21, 02:03   #6
Prime95
P90 years forever!
 
Prime95's Avatar
 
Aug 2002
Yeehaw, FL

3·13·197 Posts
Default

Quote:
Originally Posted by mdettweiler View Post
It might be easiest to write a BOINC LL testing application based on ntprime, instead of Prime95. Just strip out the PrimeNet code and have it accept exponents to test on the command line...
The major problem with that is that it violates the license agreement for the gwnum library. You can use it for anything you want -- except finding Mersenne primes.

BOINC is fine but I have little interest in porting prime95 to it. Yes, it would greatly increase our computing power. However, I don't mind keeping the project smaller - it makes it more likely that prime discoverer's are participating due to a love of math.
Prime95 is offline   Reply With Quote
Old 2010-09-21, 03:31   #7
moebius
 
moebius's Avatar
 
"CharlesgubOB"
Jul 2009
Germany

2·313 Posts
Default

Furthermore, I could be tempted again to help design and analyze quantum computing algorithms instead of the lengthy searching for primes. LOL.
moebius is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
BOINC.BE BATKrikke Teams 2 2010-03-05 18:57
Boinc Xentar Sierpinski/Riesel Base 5 4 2009-04-25 10:26
BOINC? masser Sierpinski/Riesel Base 5 1 2009-02-09 01:10
BOINC? KEP Twin Prime Search 212 2007-04-25 10:29
BOINC bebarce Software 3 2005-12-15 18:35

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


Fri Dec 3 13:27:42 UTC 2021 up 133 days, 7:56, 0 users, load averages: 0.82, 1.10, 1.19

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, 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.