This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Ω  to define a total order on c. Explain how this relates to asymptotic analysis of algorithms. 2. Compare Amdahl’s Law to the bounds presented in the paper by Gustafson. What assumptions does each author make? Which view do you think is more realistic? Give a concrete numerical example of the difference in predicted speedup between the two models. 3. Consider a parallel version of the merge sort algorithm discussed in class. Calculate the theoretical speedup of such an algorithm. How does this result fit into the frameworks discussed in Problem 2? 4. Is superlinear speedup theoretically possible? Is it possible in practice? Explain a situation in which you might observe superlinear speedup in practice. 5. Solve 2 of the recurrence relations in Miller and Boxer page 62. Programming Problems 6. TBD...
View
Full
Document
This note was uploaded on 08/06/2008 for the course IE 495 taught by Professor Linderoth during the Fall '08 term at Lehigh University .
 Fall '08
 Linderoth
 Operations Research

Click to edit the document details