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
- Suppose now that one random sample of size 200 is selected from the population of young couples . The mean of this sample is $ 623 . Based on this information
- R . C . Barker makes purchasing decisions for his company . One product that he buys costs $ 50 per unit when the order quantity is less than 500 . When the
- The client takes several prescription medications and asks the nurse about using complementary and alternative medicine . What is the best reply by the nurse ?