Changes

== Progress ==

=== Pi ===

This is a comparison between two programs that calculate Pi.

40 }

There is only one for loop in this program (on line 18); it executes ''d'' times, where ''d'' is the first argument provided to the program on the command line. Summing up the operations in the (predicted) hotspot, T(n) = 11n + 3; therefore O(n) runtime.

Using Amdahl's Law:

P = 1708ms / 1725ms (using the third test data from below...)

The maximum speedup on the test system is approximately 33 times.

''The following tests were done on the Matrix server:''

57 }

The (predicted) hotspot begins from line 35 and ends at line 44. Although there are two for loops, the outer for loop executes ''n'' / ''stride'' times while the inner for loop executes ''stride'' times; the actual iteration is just ''n'' ( O(n) runtime ).

Using Amdahl's Law:

P = 10883ms / 10903ms (using the last sample of the third test data from below...)

The maximum speedup on the test system is approximately 44 times.

''The following tests were done on the Matrix server:''