Transpose of a matrix operation is given below: for (i = 0; i < n; i++)...

  

Transcribed Image Text:

Transpose of a matrix operation is given below: for (i = 0; i < n; i++) { for (j=0; j < n; j++) { output [j][i] = input[i][j]; } } Plot the memory access as a function of time in the following figure and comment on its data locality. How can one improve the performance of this code segment? Transpose of a matrix operation is given below: for (i = 0; i < n; i++) { for (j=0; j < n; j++) { output [j][i] = input[i][j]; } } Plot the memory access as a function of time in the following figure and comment on its data locality. How can one improve the performance of this code segment?