Assume that we have a two dimensional array 60 $\times$ 60. Each elements is of 4 bytes and array is stored in row major order. RAM is 2 MN and cache is 8 KB with each block of 16 bytes.
L1:
for (i=0; i<60; i++)
{
for (j=0; j<60; j++)
{
printf(“%d”, a[i][j]);
}
}
L2:
for (t=59; t>=0; t- -)
{
for (j=59; j>=0; j- -)
{
printf(“%d”, a[i][j]);
}
}
In case of direct mapped cache, the number of cache misses are_____ (Assume that cache is empty initially)