wPrime uses 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.
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 4 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.
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 4 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.
The FX-8150 is comprehensively outperformed by the Phenom II 1100T in all of these tests, despite the extra cores and clockspeed. The single threaded tests show each thread is weaker than a Phenom II in wPrime. This isn't a good start, though this is just a synthetic test and not necessarily representative of day-to-day performance.
