wPrime Multi-threaded Benchmark 2.10
Author:
wPrime Systems
Date: 04/29/2015 Size: 998 KB License: Freeware Requires: Win 10 / 8 / 7 / Vista / XP Downloads: 15582 times ![]() Restore Missing Windows Files |
![]() Download@Authors Site Download@MajorGeeks Download@MajorGeeks
|
MajorGeeks: Setting the standard for editor-tested, trusted, and secure downloads since 2001. |
Join the MajorGeeks Mailing List to get the latest updates and exclusive offers!
wPrime is a leading multi-threaded benchmark for x86 processors that tests your processor performance by calculating square roots with a recursive call of Newton's method for estimating functions
With f(x)=x2-k, where k is the number we're sqrting, until Sgn(f(x)/f'(x)) does not equal that of the previous iteration, starting with an estimation of k/2. It then uses an iterative calling of the estimation method a set amount of times to increase the accuracy of the results. It then confirms that n(k)2=k to ensure the calculation was correct. It repeats this for all numbers from 1 to the requested maximum.
The aim was to make a perfectly threaded benchmark, such that it would consistently use 100% of the CPU while in use. This is achieved by using CPUz to detect the CPU count and use exactly that many processing threads to avoid any performance losses due to multiple threads running on any single physical thread. Each thread is designed to do 1/n of the work, where n is the number of threads. For example, if you're calculating 16 roots on 4 CPU's, each CPU will calculate four roots. Some might argue that this style of threading is unrealistic in real-time performance, but in fact is quite indicative of performance in several real-world tasks such as F@H which allows you to run several instances of the work at any one time.
wPrime retrieves most hardware information thanks to CPUz. It retrieves CPU information such as clock speed, code name, cache size, voltage, etc. It retrieves the motherboard model and the amount, speed and timings of your memory.
With f(x)=x2-k, where k is the number we're sqrting, until Sgn(f(x)/f'(x)) does not equal that of the previous iteration, starting with an estimation of k/2. It then uses an iterative calling of the estimation method a set amount of times to increase the accuracy of the results. It then confirms that n(k)2=k to ensure the calculation was correct. It repeats this for all numbers from 1 to the requested maximum.
The aim was to make a perfectly threaded benchmark, such that it would consistently use 100% of the CPU while in use. This is achieved by using CPUz to detect the CPU count and use exactly that many processing threads to avoid any performance losses due to multiple threads running on any single physical thread. Each thread is designed to do 1/n of the work, where n is the number of threads. For example, if you're calculating 16 roots on 4 CPU's, each CPU will calculate four roots. Some might argue that this style of threading is unrealistic in real-time performance, but in fact is quite indicative of performance in several real-world tasks such as F@H which allows you to run several instances of the work at any one time.
wPrime retrieves most hardware information thanks to CPUz. It retrieves CPU information such as clock speed, code name, cache size, voltage, etc. It retrieves the motherboard model and the amount, speed and timings of your memory.

Top Downloads In Benchmarking




