Prime for Mac OS X - xGrid

2006-01-10, 16:34

I have an Apple xGrid with 16 total processors (and growing) that I want to use for Mersenne Prime calculations, any suggestions on where to get software?

Ken_g6 · 2006-01-10, 17:16

You want either MLucas or GLucas. I'm not sure which one would be faster, or better on 16 processors.

victor · 2006-01-10, 19:04

Quote:

Originally Posted by Ken_g6

You want either MLucas or GLucas. I'm not sure which one would be faster, or better on 16 processors.

I'm quite sure that Glucas will be better.

ewmayer · 2006-01-10, 22:16

Quote:

Originally Posted by victor

I'm quite sure that Glucas will be better.

Based on what?

Citrix · 2006-01-10, 23:53

ewmayer,

Is it possible for you to modify your program so it can test numbers like k*2^n+1. Several members of the PSP project, have several mac's sitting around.

The algorithm is easy to implement. The multiplication modulo k*2^n+1 is the difficult part I guess. But it can't be very different from Mersenne numbers (I do not completely understand FFT)

What do you think, is it possible to implement the algorithm/multiplication?

Thanks,
Citrix

ewmayer · 2006-01-11, 02:42

Quote:

Originally Posted by Citrix

ewmayer,

Is it possible for you to modify your program so it can test numbers like k*2^n+1.

Possible? Yes. But due to N (>> 1) more-pressing issues, the next major release will only allow the following:

1) k = -1, n prime;

2) k = +1, n a power of 2.

(I.e. Mersennes and Fermats.)

Citrix · 2006-01-11, 03:13

Thankyou, for considering the request. (even if it will not be fulfilled)

Citrix

ewmayer · 2006-01-11, 20:16

Quote:

Originally Posted by Citrix

Thankyou, for considering the request. (even if it will not be fulfilled)

Oh, rest assured it will be fulfilled - just not as fast as you'd like. ;)

2006-01-10, 16:34	#1
tdpaxton 634₁₀ Posts	Prime for Mac OS X - xGrid I have an Apple xGrid with 16 total processors (and growing) that I want to use for Mersenne Prime calculations, any suggestions on where to get software?

2006-01-11, 03:13	#7
Citrix Jun 2003 11000101110₂ Posts	Thankyou, for considering the request. (even if it will not be fulfilled) Citrix Last fiddled with by Citrix on 2006-01-11 at 03:13

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
(M48) NEW MERSENNE PRIME! LARGEST PRIME NUMBER DISCOVERED!	dabaichi	News	571	2020-10-26 11:02
Twin Prime Days, Prime Day Clusters	cuBerBruce	Puzzles	3	2014-12-01 18:15
disk died, prime work lost forever? where to put prime? on SSD or HDD?	emily	PrimeNet	3	2013-03-01 05:49
Prime Cullen Prime, Rest in Peace	hhh	Prime Cullen Prime	4	2007-09-21 16:34
The 40th known Mersenne prime, 220996011-1 is not PRIME!	illman-q	Miscellaneous Math	33	2004-09-19 05:02

2006-01-10, 17:16	#2
Ken_g6 Jan 2005 Caught in a sieve 5·79 Posts	You want either MLucas or GLucas. I'm not sure which one would be faster, or better on 16 processors.

2006-01-10, 23:53	#5
Citrix Jun 2003 2·7·113 Posts	ewmayer, Is it possible for you to modify your program so it can test numbers like k2^n+1. Several members of the PSP project, have several mac's sitting around. The algorithm is easy to implement. The multiplication modulo k2^n+1 is the difficult part I guess. But it can't be very different from Mersenne numbers (I do not completely understand FFT) What do you think, is it possible to implement the algorithm/multiplication? Thanks, Citrix