→The Monte Carlo Simulation (PI Calculation)
== Progress ==
=== Assignment 1 - Select and Assess ===
=== Array Processing ===
Subject: Array Processing
From the call graph, multiply() took major runtime more than 99%, as it contains 3 for-loop, which is O(n^3). Besides, init() also became the second busy one, which has a O(n^2).
As the calculation of elements is independent of one another - leads to an embarrassingly parallel solution. Arrays elements are evenly distributed so that each process owns a portion of the array (subarray). It can be solved in less time with multiple compute resources than with a single compute resource.
=== The Monte Carlo Simulation (PI Calculation) ===
Subject: The Monte Carlo Simulation (PI Calculation)
Got the code from here: