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

2. What is meant by the term cost-optimal? a)When the cost of computers is the lowest b)When the parallel time complexity x number of processors used = sequential time complexity c)When the number of lines of code is at the lower bound (minimum) d)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) a)O(log n) b)O(n) c)O(n 2 ) d)O(n 3 )

4. What is the parallel time complexity of matrix multiplication using n 2 processors (Matrices each n x n) a)O(log n) b)O(n) c)O(n 2 ) d)O(n 3 )

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) a)n/s b)(n/s) 2 c)s 2 d)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) a). b). c). d)None of the other answers

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