![]() |
|
|
#12 |
|
6809 > 6502
"""""""""""""""""""
Aug 2003
101×103 Posts
23·1,223 Posts |
|
|
|
|
|
|
#13 | |
|
Dec 2008
34116 Posts |
Quote:
Also, does anyone know how I can run Prime95 on a Windows XP AMD Athlon x64 processor (as I have found an excellent computer)? |
|
|
|
|
|
|
#14 |
|
Dec 2008
83310 Posts |
I bet if you installed an x86 emulator for the Cell then we can run MPrime. I just don't know of any x86 emulators for the Cell processor architecture... Any ideas?
|
|
|
|
|
|
#15 | ||
|
6809 > 6502
"""""""""""""""""""
Aug 2003
101×103 Posts
23×1,223 Posts |
Quote:
Quote:
|
||
|
|
|
|
|
#16 |
|
Dec 2008
72·17 Posts |
So basically, this weekend (or the next) I will attempt to compile MLucas. Note the word "attempt". If you guys want to help me out you are welcome to b/c I mean the primary success of Folding@Home was due to its port to the PS3 systems, so if I/we can install on Yellowdog, then we have made a landmark in GIMPS history.
Last fiddled with by flouran on 2009-01-13 at 03:22 |
|
|
|
|
|
#17 |
|
Aug 2006
10111010110112 Posts |
Good analogy, sdbardwick.
Folding@Home doesn't do bignum operations: the Cell is perfectly suited for it. Glucas/Mlucas/Prime95 do major bignum operations with L-L, so the Cell is poorly suited for that. But regardless, I await the results (if you're able to compile). |
|
|
|
|
|
#18 | |
|
Dec 2008
72×17 Posts |
Quote:
What I am truly asking is what is the best option to choose in order to increase the probability of discovering a previously unknown Mersenne prime (I have two computers that are running Prime95 and MPrime currently)? Last fiddled with by flouran on 2009-01-13 at 03:47 |
|
|
|
|
|
|
#19 |
|
Aug 2006
10111010110112 Posts |
For Prime95 (on your Athlon):
If you want to maximize your chances for finding a new Mersenne prime, do only L-L work (no factoring or ECM), and run one test per core (not across several cores). Obviously the advice has nothing to do with your Cell experiment. |
|
|
|
|
|
#20 |
|
Oct 2008
California
22×59 Posts |
Also though the Cell may not be able to run LL/DC tests very well, I am interested how it does TF.
|
|
|
|
|
|
#21 | |
|
Dec 2008
34116 Posts |
Quote:
|
|
|
|
|
|
|
#22 |
|
Aug 2006
3·1,993 Posts |
LL-NF. If you want to maximize your chance to find a Mersenne prime, you want to search the smallest numbers possible -- larger numbers are both harder to test and less likely to be prime. Further, if you can have someone else do the TF work, that makes your throughput on LL higher.
Joining a team or not doesn't affect your chance to find a Mersenne prime. |
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| 128-bit OS'es and GIMPS? | ixfd64 | Software | 22 | 2011-10-31 22:23 |
| GIMPS Nub | SayMoi | Information & Answers | 5 | 2009-04-06 15:29 |
| GIMPS uses only 1 cpu | Unregistered | Information & Answers | 7 | 2009-01-10 20:01 |
| GIMPS should pay | Vijay | Lounge | 40 | 2005-07-01 18:10 |
| Why do you run GIMPS ? | Prime Monster | Lounge | 12 | 2003-11-25 19:04 |