Problem 1 We discussed in class the column sweep algorithm as it applies to parallelize the following matrix recurrence problem: where A was a nx n lower-triangular matrix, C is a column vector and X is a variable column vector. In this proble, you will apply the column sweep algorithm to parallelize the same type of recurrence but matrix A will be a general n n matrix. Q11 12 13 14 021 22 a23 24 @gl 32 a33 34 0.41 42 a43 a44 We will use upto n processors operating in SIMD mode (single-instruction/multiple-data) a) Describe the major steps of the column sweep algorithm as they apply to this problem. Show the memory data structuring of C, A and X that supports ths SIMD computation, assuming every r has its own memory module b) What is the speedup and efficiency of the parallel scheme in comparison to a single processor solution. How about the utilization? c) By careful consideration of the workload, it is possible to reduce the resource requirements by al locating non-overlapping (in time) computation steps into the same processor. The overall parallel time should remain the same. Describe you need at most your processo r allocation scheme. How many processors do d) Suppose there are only m processors and n memory modules, respectively, where m<.>