Added a 1GB calculation option (Why?, because I can, and the number is kinda magical...)
Added L2 Cache options at CrazyNutz's request
Added additional Memory threshold options in order to be able perform a memory only calculation (You'll need over 20 GB of memory for that...)
Added Memory block sizes as well for same reason
Changed the output of the program (looks a bit like PiFast now...)
I have changed my mind about adding a possibility to let you select the number of digits to calculate. I would like to see the feature as well, however I am not able to make any kind of validation for the calculation. Currently the validation is based on a hash code algorithm. I one digit isn't correct the computation has failed. Since it's a 64-bit code there's only a very small chance you'll get the right hash with a faulty computation.
Unfortunately I discovered a bug while generating hash codes for the large numbers. It seems computations from 128M might run into a situation where the program crashes. Haven't been able to find out exactly what is causing this.
Plans for version 1.4 beta
Finding and fixing the large computations error
Improvements to the algorithms (avoid RTTI in several structures)
Reducing memory leaks if possible (these might be related to inconsistent times)
Calculate the hashes for 256M, 512M and 1 GB
KTE:
Can you easily reproduce this time difference? I am a bit worried about it because you mention over 1 second differences. That is way to much for me to find acceptable. If you can please let me know. The inverse SQRT using about 75% cpu is normal behavior, I cannot have it utilize more cpu because of the way the algorithm is put together
Reply With Quote
Bookmarks