mersenneforum.org  

Go Back   mersenneforum.org > Fun Stuff > Lounge

Reply
 
Thread Tools
Old 2008-09-14, 14:55   #12
Flatlander
I quite division it
 
Flatlander's Avatar
 
"Chris"
Feb 2005
England

207710 Posts
Default

Quote:
Originally Posted by davieddy View Post
You've been reading
http://primes.utm.edu/notes/by_year.html#3
haven't you?
Nope. I haven't looked at that for a year or so.
Tony's guess of 2023 looked too far ahead so I went about half way.
I was also figuring on a couple of hardware breakthroughs and everyone having 16 or 32 cores.
It's all my other posts that are pure plagiarism.

edit:
I was also thinking that there might be a reward for the first 100m digit prime, so people would be searching artificially high.

Last fiddled with by Flatlander on 2008-09-14 at 15:14
Flatlander is offline   Reply With Quote
Old 2008-09-14, 15:33   #13
T.Rex
 
T.Rex's Avatar
 
Feb 2004
France

22×229 Posts
Default HW and FFT scalability !!

Quote:
Originally Posted by Flatlander View Post
... everyone having 16 or 32 cores.
The main problem with many cores is the difficulty/cost to have a good hardware and software scalability !!
HW scalability is VERY expensive now. FFT scalability is difficult. Preliminary results (to be confirmed) are showing that, on a 8 cores, Mlucas is running 5.4 times faster than with only 1, though Prime95 has a 3.3 factor only. It would be worst with 16 or 32 cores. IBM/Bull Power machines are VERY scalable ! But a 64xPower6 machine costs more than 1MEuros...
Tony
T.Rex is offline   Reply With Quote
Old 2008-09-14, 15:38   #14
davieddy
 
davieddy's Avatar
 
"Lucan"
Dec 2006
England

2·3·13·83 Posts
Default

Quote:
Originally Posted by Flatlander View Post
Nope. I haven't looked at that for a year or so.
Tony's guess of 2023 looked too far ahead so I went about half way.
I was also figuring on a couple of hardware breakthroughs and everyone having 16 or 32 cores.
It's all my other posts that are pure plagiarism.

edit:
I was also thinking that there might be a reward for the first 100m digit prime, so people would be searching artificially high.
viz a viz the GIMPS wavefront, a doubling of the exponent involves
a multiplying by ten in the power needed to keep up:
iterations x numbers to test x time per iteration.

People tried leaping to 10M digits a long time ago without success.

David

Last fiddled with by davieddy on 2008-09-14 at 15:51
davieddy is offline   Reply With Quote
Old 2008-09-14, 15:43   #15
retina
Undefined
 
retina's Avatar
 
"The unspeakable one"
Jun 2006
My evil lair

11000001101002 Posts
Default

Quote:
Originally Posted by Flatlander View Post
I was also thinking that there might be a reward for the first 100m digit prime, so people would be searching artificially high.
There is, currently US$150K from EFF.
retina is online now   Reply With Quote
Old 2008-09-14, 16:03   #16
Flatlander
I quite division it
 
Flatlander's Avatar
 
"Chris"
Feb 2005
England

31·67 Posts
Default

Quote:
Originally Posted by T.Rex View Post
The main problem with many cores is the difficulty/cost to have a good hardware and software scalability !!
HW scalability is VERY expensive now. FFT scalability is difficult. Preliminary results (to be confirmed) are showing that, on a 8 cores, Mlucas is running 5.4 times faster than with only 1, though Prime95 has a 3.3 factor only. It would be worst with 16 or 32 cores. IBM/Bull Power machines are VERY scalable ! But a 64xPower6 machine costs more than 1MEuros...
Tony
I was assuming people would run 16 or 32 concurrent tests and CPUs would have huge on-die caches. (But why would anyone apart from prime hunters etc. want that??? And I've used up one of my "couple of hardware breakthroughs". Just one left; I'd better shut up.)


edit (Will I never learn?):
How big would an on-die cache have to be to hold a 100m digit test?

Last fiddled with by Flatlander on 2008-09-14 at 16:36
Flatlander is offline   Reply With Quote
Old 2008-09-14, 16:38   #17
T.Rex
 
T.Rex's Avatar
 
Feb 2004
France

22·229 Posts
Default

Quote:
Originally Posted by Flatlander View Post
I was assuming people would run 16 or 32 concurrent tests and CPUs would have huge on-die caches.
Yes, you're right. But, since the speed of CPUs will stay about 3GHz, one core will take several months to check 1 bigger exponent. So people will use 2, then 4, ... cores for one exponent. In order to see a result every 1 or 2 months, I think. But I may be wrong...
T.
T.Rex is offline   Reply With Quote
Old 2008-09-14, 16:41   #18
jinydu
 
jinydu's Avatar
 
Dec 2003
Hopefully Near M48

2·3·293 Posts
Default

Quote:
Originally Posted by davieddy View Post
People tried leaping to 10M digits a long time ago without success.
As is discussed here (http://www.mersenneforum.org/showthr...114#post142114), several exponents above 100M digits have already been reserved for LL testing. But I'm not sure ANONYMOUS seriously intends to carry through the LL tests to the end.
jinydu is offline   Reply With Quote
Old 2008-09-14, 19:02   #19
ixfd64
Bemusing Prompter
 
ixfd64's Avatar
 
"Danny"
Dec 2002
California

45268 Posts
Default

Quote:
Originally Posted by T.Rex View Post
The main problem with many cores is the difficulty/cost to have a good hardware and software scalability !!
HW scalability is VERY expensive now. FFT scalability is difficult. Preliminary results (to be confirmed) are showing that, on a 8 cores, Mlucas is running 5.4 times faster than with only 1, though Prime95 has a 3.3 factor only. It would be worst with 16 or 32 cores. IBM/Bull Power machines are VERY scalable ! But a 64xPower6 machine costs more than 1MEuros...
Tony
I guess we really need a new version of Prime95!
ixfd64 is offline   Reply With Quote
Old 2008-09-14, 19:14   #20
henryzz
Just call me Henry
 
henryzz's Avatar
 
"David"
Sep 2007
Cambridge (GMT/BST)

23×3×5×72 Posts
Default

25.6 is a new version of Prime95
henryzz is offline   Reply With Quote
Old 2008-09-15, 09:04   #21
Nelson
 
Nelson's Avatar
 
Apr 2008
Regensburg..^~^..Plzeƈ

5·17 Posts
Default

Quote:
Originally Posted by henryzz View Post
25.6 is a new version of Prime95
I think ixfd64 means newer than Prime95 v.25.6. That's what Tony is using to arrive at his scaling benchmark. Prime95 v.24.14 uses only one thread and cannot achieve any type of scaling.

nelson
Nelson is offline   Reply With Quote
Old 2008-09-15, 09:34   #22
fivemack
(loop (#_fork))
 
fivemack's Avatar
 
Feb 2006
Cambridge, England

11001000100112 Posts
Default

Quote:
Originally Posted by Flatlander View Post
edit (Will I never learn?):
How big would an on-die cache have to be to hold a 100m digit test?
100M digits is 330M bits; so the FFT size is about 2^24 complex-doubles of 16 bytes each, so 256MB. Which is not ridiculous for on-die cache for an ultra-high-end product in 22nm, a high-end infinitely-rich-gamer one in 16nm or a normal-cost-unconscious-user one in 11nm - Intel's 32nm process has a cell size of 0.182um^2, so 256MB in that process would occupy 390mm^2 and leave little space for cores on a maximum-size die.

(to calibrate, current ultra-high-end is Dunnington, high-end infinitely-rich-gamer is QX9772, normal-user is Q6600)

Tulsa ('Xeon 7100 series') has a 16MB L3 cache made with 0.624um^2 cells in 65nm; the Itanium 9100 has a 24MB L3 cache made with 1um^2 cells in 90nm but that's still only about 190mm^2. So it's probably unrealistic to expect more than 100mm^2 of L3 cache on any remotely affordable processor.
fivemack is offline   Reply With Quote
Reply



Similar Threads
Thread Thread Starter Forum Replies Last Post
CPU time for 100M digit prime test biggerben Software 7 2014-10-24 05:47
I want a 100M digit Mersenne that.... JuanTutors PrimeNet 8 2012-12-06 13:47
What minimum exponent would give 100M digit prime? odin Software 7 2010-04-18 13:57
100M digit prime Unregistered Information & Answers 10 2010-03-24 20:16
M43 discovery date Prime95 Lounge 55 2006-01-30 19:51

All times are UTC. The time now is 22:50.


Fri Jul 16 22:50:09 UTC 2021 up 49 days, 20:37, 1 user, load averages: 1.68, 2.66, 2.85

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.