Examine the code given below to compute the average of an array:

total = 0; for(j=0; j

sub_total = 0; /* Nested loops to avoid overflow */

for(i=0; i

sub_total += A[j*N + i];

}

total += sub_total/N;

} average = total/k;

When designing a cache to run this application, given a constant cache capacity and associativity, will you want a larger or smaller block size? Why?

total = 0; for (i=0; j