Chapter 6.4, Problem 6.11PP

A.

Program Plan Intro

Given Information:

A hypothetical cache that uses the high order “s” bits of an address as the set index is given. For such a cache, the contiguous chunks of memory blocks are mapped to the same cache sets.

B.

Program Plan Intro

Given Information:

The following code is given:

//traverse the array

for(i=0;i<4096;i++)

{

//add array elements

sum+=array[i];

}

The code runs on a system with cache of the form(S,E,B,m)= (512,1,32,32).