How would you design a CPU/GPU for prime number crunching?

emily · 2012-02-19, 20:14

Suppose you could design a CPU specifically for running LL primality tests using mprime (suppose it was customized for your processor). How would your ideal prime CPU look like?

What would be the optimal:
- number of cores
- frequency VS number of cores, would a very fast single-core be preferable?
- more integer cores than floating point (like Bulldozer) or the same?
- cache sizes and organization (L0/L1/L2/L3)
- would you share L2 cache between cores like Bulldozer does? or dedicate L2 to every core like Nehalem?
- faster low-latency L1/L2 or larger L3 cache?
- memory bandwidth? (more channels or higher MHz?)
- obviously it would include SSE/AVX, but what other SIMD features would you add? what would you change compared to current processors? AVX is only for floating point now, would the integer support in AVX2 be useful?
- could MIMD be of any use?

is there anything we could remove from current CPUs that isn't needed in prime and increases temperature and power usage without benefit to GIMPS? The internal GPU of course, but is there anything else?

And what about the ideal GPU? It would run double precision FP obviously, but what other design requirements would you have? Would you prefer higher frequency to more parallelization?

Out of all the CPUs and GPUs that have been manufactured, which architecture was the most efficient for GIMPS? (not actual performance which is related to technology etc, but from a design point of view)

LaurV · 2012-02-20, 03:33

The CPU should have 4 memory registers and do a single fast operation (beside of I/O reading/writing the registers, or other operation that can all be slow). There registers should have each 4 billion bits, and the operation should be hardware multiplication: mul Rx,Ry,Ra. This would multiply Rx with Ry, with the fastest possible algorithm and give the lowest part in the specified Ra register, and the highest part in the unspecified Rb.

edit: well, I can live with 3 registers only, and do squaring... :P

jasong · 2012-02-20, 03:38

Quote:

Originally Posted by emily

And what about the ideal GPU? It would run double precision FP obviously...

No, actually, double precision FP is a kludge because we're dealing with the floating point registers. The optimal thing would be to have all the registers be integer-based, then you wouldn't have to deal with that extra rounding step and possible errors.

Dubslow · 2012-02-20, 04:05

Please look for answers before starting a new thread. Specifically, there is a stickied FAQ for this question.

http://www.mersenneforum.org/showthread.php?t=15325
http://www.mersenneforum.org/showthread.php?t=12720

emily · 2012-02-20, 18:46

Yeah looks like I should read more before asking! Thanks :)

2012-02-19, 20:14	#1
emily Feb 2012 Athens, Greece 47₁₀ Posts	How would you design a CPU/GPU for prime number crunching? Suppose you could design a CPU specifically for running LL primality tests using mprime (suppose it was customized for your processor). How would your ideal prime CPU look like? What would be the optimal: - number of cores - frequency VS number of cores, would a very fast single-core be preferable? - more integer cores than floating point (like Bulldozer) or the same? - cache sizes and organization (L0/L1/L2/L3) - would you share L2 cache between cores like Bulldozer does? or dedicate L2 to every core like Nehalem? - faster low-latency L1/L2 or larger L3 cache? - memory bandwidth? (more channels or higher MHz?) - obviously it would include SSE/AVX, but what other SIMD features would you add? what would you change compared to current processors? AVX is only for floating point now, would the integer support in AVX2 be useful? - could MIMD be of any use? is there anything we could remove from current CPUs that isn't needed in prime and increases temperature and power usage without benefit to GIMPS? The internal GPU of course, but is there anything else? And what about the ideal GPU? It would run double precision FP obviously, but what other design requirements would you have? Would you prefer higher frequency to more parallelization? Out of all the CPUs and GPUs that have been manufactured, which architecture was the most efficient for GIMPS? (not actual performance which is related to technology etc, but from a design point of view)

2012-02-20, 03:33	#2
LaurV Romulan Interpreter "name field" Jun 2011 Thailand 41×251 Posts	The CPU should have 4 memory registers and do a single fast operation (beside of I/O reading/writing the registers, or other operation that can all be slow). There registers should have each 4 billion bits, and the operation should be hardware multiplication: mul Rx,Ry,Ra. This would multiply Rx with Ry, with the fastest possible algorithm and give the lowest part in the specified Ra register, and the highest part in the unspecified Rb. edit: well, I can live with 3 registers only, and do squaring... :P Last fiddled with by LaurV on 2012-02-20 at 03:34

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
are blade servers good for number crunching?	ixfd64	Hardware	11	2011-11-02 23:54
DSP hardware for number crunching?	ixfd64	Hardware	15	2011-08-09 01:11
The prime-crunching on dedicated hardware FAQ	jasonp	Hardware	142	2009-11-15 23:20
The Number Crunching King	Primeinator	Lounge	18	2008-09-20 18:18
Number Crunching Series.	mfgoode	Puzzles	15	2006-06-08 05:34

2012-02-20, 04:05	#4
Dubslow Basketry That Evening! "Bunslow the Bold" Jun 2011 40<A<43 -89<O<-88 3·29·83 Posts	Please look for answers before starting a new thread. Specifically, there is a stickied FAQ for this question. http://www.mersenneforum.org/showthread.php?t=15325 http://www.mersenneforum.org/showthread.php?t=12720

2012-02-20, 18:46	#5
emily Feb 2012 Athens, Greece 47 Posts	Yeah looks like I should read more before asking! Thanks :)