HIGH PERFORMANCE COMPUTING QUESTIONS

I. Multiple choices (20 points, 2 points each) 1. Wrat is the optimal parallel time complexity for sorting algorithms? 2/What is the time complexity for odd-even transposition sort algorithm using n O(logn) O(ylogn) B. O(n) processors? O(n) O(nlogn) Ologn) Olog n) 3. What are the time complexities of the best case and the worse case for parallel quicksort respectively? A. O(n), O(nlogn) B. O(logn), O(nlogn) 4. In parallel bitonic mergesort, how many steps are needed for 32 numbers O(n), O(n) A. 32 B. 160 15 D. 5 ysteps are needed to sort 256 numbers on a 16x16 mesh using shearsort? C. 1 D. 144 36 6. Which of the following is NOT a naturally stable sorting algorithm? A. bubble so B. bucket sort rank sort D. counting sort 7. Which of the following parallel algorithms is cost optimal fr a sequential algorithm with 0(r)? A. O(n) with n processors B. On) with in processors O(n) with n processors D, O(logn) with ? processors 8. How to shift the elements tocalculate the matrix multiplication of C-AnnBnnin Cannon's algorithm? / A. shift A left and B downward B. shift A left and B upward C shift A right and B downward D. shift A right and B upward 9. How to pump the elements to calculate the matrix multiplication of C-Anx.xBnxn in systolic array? C. pump A right and B downward D. pump A right and B upward . pump A left and B downward 10. How many clock cycles are needed for the matrix multiplication of C,xn-Anxn ( 6) using systolic array? B. pump A left and B upward B.16 I. Multiple choices (20 points, 2 points each) 1. Wrat is the optimal parallel time complexity for sorting algorithms? 2/What is the time complexity for odd-even transposition sort algorithm using n O(logn) O(ylogn) B. O(n) processors? O(n) O(nlogn) Ologn) Olog n) 3. What are the time complexities of the best case and the worse case for parallel quicksort respectively? A. O(n), O(nlogn) B. O(logn), O(nlogn) 4. In parallel bitonic mergesort, how many steps are needed for 32 numbers O(n), O(n) A. 32 B. 160 15 D. 5 ysteps are needed to sort 256 numbers on a 16x16 mesh using shearsort? C. 1 D. 144 36 6. Which of the following is NOT a naturally stable sorting algorithm? A. bubble so B. bucket sort rank sort D. counting sort 7. Which of the following parallel algorithms is cost optimal fr a sequential algorithm with 0(r)? A. O(n) with n processors B. On) with in processors O(n) with n processors D, O(logn) with ? processors 8. How to shift the elements tocalculate the matrix multiplication of C-AnnBnnin Cannon's algorithm? / A. shift A left and B downward B. shift A left and B upward C shift A right and B downward D. shift A right and B upward 9. How to pump the elements to calculate the matrix multiplication of C-Anx.xBnxn in systolic array? C. pump A right and B downward D. pump A right and B upward . pump A left and B downward 10. How many clock cycles are needed for the matrix multiplication of C,xn-Anxn ( 6) using systolic array? B. pump A left and B upward B.16