1 / 7

Numerical Algorithms Quiz questions

Numerical Algorithms Quiz questions. ITCS4145/5145, Parallel Programming March 14, 2013. What is meant by the term cost-optimal?. When the cost of computers is the lowest When the parallel time complexity x number of processors used = sequential time complexity

arch
Download Presentation

Numerical Algorithms Quiz questions

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Numerical AlgorithmsQuiz questions ITCS4145/5145, Parallel Programming March 14, 2013.

  2. What is meant by the term cost-optimal? • When the cost of computers is the lowest • When the parallel time complexity x number of processors used = sequential time complexity • When the number of lines of code is at the lower bound (minimum) • When the sequential time complexity x number of processors used = parallel time complexity

  3. What is the sequential time complexity of matrix multiplication(Matrices each n x n) • O(log n) • O(n) • O(n2) • O(n3)

  4. What is the parallel time complexity of matrix multiplication using n2 processors(Matrices each n x n) • O(log n) • O(n) • O(n2) • O(n3)

  5. How many processors would be needed to perform matrix multiplication using block multiplication with s x s blocks (sub-matrices) and n x n matrices?(Assume n is a multiple of s) • n/s • (n/s) 2 • s2 • None of the other answers

  6. What is the parallel time complexity of matrix multiplication using block multiplication with s x s blocks (sub-matrices) using the number of processors from the last question?(Assume n is a multiple of s) • . • . • . • None of the other answers

  7. Discussion • How can block matrix multiplication take advantage of cache memory?

More Related