240
edits
Changes
→Pi
Drop points - took - 20884 millisecs
Pi: 3.14172063999999995331791069475002586841583251953125000000000000
* STAGE 4 - Analysis
Both programs calculate finite results of Pi, however the Leibniz implementation has higher accuracy and calculates more digits per iteration. Since both algorithms have O(n) runtime, the Leibniz implementation is also superior in terms of speed.
With regards to the hotspots, both programs contain one area that holds over 99% of their total execution time; these areas will be the focus for parallelization. The programs were revised to remove all data dependencies, thus there should be no conflicts between threads when the parallel codes are applied.
