For the problem of adding n numbers on p processing elements (Example 5.1), plot the speedup curves, assuming that the base problem for p = 1 is that of adding 256 numbers. Use p = 1, 4, 16, 64, and 256. Assume that it takes 10 time units to communicate a number between two processing elements, and that it takes one unit of time to add two numbers. Now plot the standard speedup curve for the base problem size and compare it with the scaled speedup curve.
Hint: The parallel runtime is (n/p - 1) + 11 log p.
Recently Asked Questions
- In a capillary bed if the hydrostatic pressure at the arteriole ends is 32 mm Hg and at the venule ends is 14 mm Hg with an osmotic pressure of 22 mm Hg , the
- ASSESSMENT TASK TWO Presentation & Portfolio Instructions Now you need to deliver a presentation to train Australian Hardware managers on how to implement the
- What is the quadratic function that is created with roots -10 and -4 and a vertex at (-7, -9)?