The snippet given below is a file whose size is 256 Bytes and data block (1 line width) is 64 Bytes.

It is run on the system where the cache is used. The array holds 4-byte int values.

for (int j=0; j< step; j++){

for (int i = 0; i < 128/step; i++){

A[i * step + j] = j;

}

}

When the cache structure is direct mapping, the discovery rate (search

Find the step values that maximize and minimize the rate of data being in the cache.