![]() |
|
|
#1 |
|
Mar 2016
19·23 Posts |
A peaceful day,
I have an amd cpu with 32MB 3. level cache and make double checking. Is the 3. level cache big enough for first prime checking resp. how much space does the implemented fft needs ? Thanks for a short answer. ps: I can feel it, we are aproaching to the next mersenne prime.
|
|
|
|
|
|
#2 |
|
"Viliam Furík"
Jul 2018
Martin, Slovakia
2×401 Posts |
The current FTC wavefront takes up about 44 MiB (mebibytes - basically megabytes, but counted in base 2, so it's 220 bytes, instead of 106) of L3 cache.
You can calculate the usage with this rule: Take the FFT size, e.g. 5.5M, and multiply it by 8 B (bytes). 5.5M FFT uses 5.5*8 = 44 MiB of cache. That means that with 32 MiB of L3 cache, you are in the RAM territory and are bottlenecked by its speed. If you want to go faster, either change out the CPU for one of the Ryzen 9 CPUs or change out the memory for a faster one (3600 MHz for Ryzen 3000; 4000 MHz is said to be the best for Ryzen 5000). |
|
|
|
![]() |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Huge exponent | paulunderwood | Miscellaneous Math | 15 | 2016-01-21 18:56 |
| Huge ECM speed increase with GMP 6.0.0 | wombatman | GMP-ECM | 13 | 2014-04-03 22:29 |
| An aliquot sequence with huge, huge, huge tracts of sand !!! | garambois | Aliquot Sequences | 50 | 2012-01-19 18:25 |
| That is a HUGE factor | Dubslow | Information & Answers | 9 | 2011-09-09 06:01 |
| Best way to store huge data | HiddenWarrior | Data | 18 | 2005-10-11 03:53 |