« Section 0Syllabus for all sect | Main | April 13 Syllabus for all sect »
April 12, 2006
Homework Syllabus for all sect
The very last homework! Congratulations on enduring to the end.
1. Problem 11.4
2. Suppose you have a parallel algorithm that runs in O(T(n,p)) time for T(n,p) = log n for a problem of size n using p processors. Suppose that the best known sequential algorithm solves problems of size n in O(S(n)) time for S(n) = n log n. What is the speedup for this algorithm and what is the efficiency? Did this algorithm achieve linear speedup?
Posted by jones at April 12, 2006 09:19 AM
Comments
Post a comment
Thanks for signing in, . Now you can comment. (sign out)
(If you haven't left a comment here before, you may need to be approved by the site owner before your comment will appear. Until then, it won't appear on the entry. Thanks for waiting.)