consider the following code,
#define N 4096
int A[N], B[N];
int i;
.
.
for(i = 0; i < N; i++)
A[i] = A[i] + B[i];
.
Assume that in the system the main memory address is 32 bits andhaving 2-way set associative cache with 16 bytes per block, setfield of 8 bits and having LRU replacement policy. initially cacheis empty.
also assume that A and B are aligned to a 4KB boundary and arecontiguous in main memory. integers are 32bits.
what is miss rate for 2-way set associative cache for runningthe above for loop code?
Expert Answer
An answer will be send to you shortly. . . . .