The result of the permuted loops in the following function so that it scans the three-dimensional array a with a stride-1 reference pattern is given below.
Using C, the relevant codes are given below:
{
int i,j,k,sum=0;
for(i=0;i<M;i++)
for(j=0;j<N;j++)
for(k=0;k<N;k++)
sum+=a[i][j][k];
return sum;
}
When more than two loops are reordered, loop permutation (also known as loop reordering) is a generalization of this loop exchange transformation.
A straightforward example of performing loop interchange is shown in the code below.
According to compiler theory, loop optimization is the process of quickening loop execution and lowering loop overheads.
Loop Permutation is crucial for increasing cache performance and maximizing the potential of parallel processing.
The majority of a scientific program's execution time is spent in loops, hence numerous compiler optimization techniques have been created to speed them up.
Learn more about 3-dimensional array:
https://brainly.com/question/3500703
#SPJ1
Full Question
See attached image.