next up previous contents
Next: Computing Environment Up: Solving Problems and Implementing Previous: Generating permutations and finding   Contents

General Comments on Running times

Upon inspecting figures 3.3 to 3.6, we would see a general trend of employing parallel algorithms. The program running times' improvement were dramatic in the first few processors. Although scalar running times would largely depend on the sizes of the problem domains, as the number of processors increases, less dramatic the decrease of running times. This is not to say that it is not beneficial to have more processors but within the scope of the number of processors that we had for this project, the complexity or the running time decrease as expected as we plotted the running time against the number of processors, or $y=\frac{1}{x}$ and it's clear that the all graphs resemble the shape of the typical $y=\frac{1}{x}$ graph.



J S 2002-08-14