![]() |
![]() |
#1 |
"Jason Goatcher"
Mar 2005
1101101100112 Posts |
![]()
I don't know how many have noticed this, but the dual-core AMD 5000+ computer(I don't know how many GHz it is) has 128KB of L1 cache. Now I don't know specific numbers, but if you have something that runs small amounts of code over and over again(Doesn't factoring do this?), then the 5000+ could easily be best bang for buck for those isolated applications.
I'm sure some intelligent person will call attention to this in the Seventeen or Bust Sieving forum at some point. I think they only have 9 values left, so they may have already gained the advantage, I'm not sure. Can anybody confirm or deny the advantage of factoring or p-1ing on one of these things? Benchmarks would be awesome, but an educated opinion would be very welcome. |
![]() |
![]() |
![]() |
#2 |
May 2005
22×11×37 Posts |
![]()
To be exact it has 64kB of instruction cache + 64kB data cache (per core), which BTW is standard for ANY Athlon64, so nothing new here
![]() Last fiddled with by Cruelty on 2006-06-16 at 05:46 |
![]() |
![]() |
![]() |
#3 | |
Jun 2003
536510 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#4 | |
May 2005
22·11·37 Posts |
![]() Quote:
![]() |
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
4000 < k < 5000 | otutusaus | Riesel Prime Data Collecting (k*2^n-1) | 5 | 2012-03-07 20:01 |
5000 < k < 6000 | justinsane | Riesel Prime Data Collecting (k*2^n-1) | 26 | 2010-12-31 12:27 |
TPR Reaches 5000 Factoring P90 CPU Years | jinydu | Lounge | 10 | 2007-01-15 01:40 |
Top-5000 List | edorajh | Riesel Prime Search | 17 | 2006-03-28 21:57 |
The fastest way to a top-5000 prime? | lsoule | 15k Search | 13 | 2005-09-19 20:24 |