Matrix Multiplication using a CREW PRAM.

State in pseudocode a parallel algorithm to initialize an array A[1...n] with a value X on a EREW-PRAM.

Transcribed Image Text:

1. Matrix Multiplication using a CREW PRAM. Let A,B = Rnxn be two square matrices and C = A B their matrix product given in coordinates n-1 Cij:=Aik Bkj for all i, j = {0, …., n − 1}. - k=0 Design a CREW PRAM algorithm that uses O(n³) processors and O(n³) memory to compute the matrix C in logarithmic time. a) State the pseudo-code that is needed to compute the result for n being a power of two. b) Give a simple solution if n is not a power of two. Is the asymptotic complexity affected? c) Is your solution cost-optimal? If not, make it so. 1. Matrix Multiplication using a CREW PRAM. Let A,B = Rnxn be two square matrices and C = A B their matrix product given in coordinates n-1 Cij:=Aik Bkj for all i, j = {0, …., n − 1}. - k=0 Design a CREW PRAM algorithm that uses O(n³) processors and O(n³) memory to compute the matrix C in logarithmic time. a) State the pseudo-code that is needed to compute the result for n being a power of two. b) Give a simple solution if n is not a power of two. Is the asymptotic complexity affected? c) Is your solution cost-optimal? If not, make it so. 1. Matrix Multiplication using a CREW PRAM. Let A,B = Rnxn be two square matrices and C = A B their matrix product given in coordinates n-1 Cij:=Aik Bkj for all i, j = {0, …., n − 1}. - k=0 Design a CREW PRAM algorithm that uses O(n³) processors and O(n³) memory to compute the matrix C in logarithmic time. a) State the pseudo-code that is needed to compute the result for n being a power of two. b) Give a simple solution if n is not a power of two. Is the asymptotic complexity affected? c) Is your solution cost-optimal? If not, make it so. 1. Matrix Multiplication using a CREW PRAM. Let A,B = Rnxn be two square matrices and C = A B their matrix product given in coordinates n-1 Cij:=Aik Bkj for all i, j = {0, …., n − 1}. - k=0 Design a CREW PRAM algorithm that uses O(n³) processors and O(n³) memory to compute the matrix C in logarithmic time. a) State the pseudo-code that is needed to compute the result for n being a power of two. b) Give a simple solution if n is not a power of two. Is the asymptotic complexity affected? c) Is your solution cost-optimal? If not, make it so.