Consider Prof. Vamshi‘s writes a program given below and run on system which has 2-way set associative 16 KB data cache with 32 bytes block where each word size is 32 bits and LRU replacement policy used. If base address of array 'a‘ is 0x0 and initially cache is empty then the number of data cache misses are there ______
(Assume integer takes 4 bytes.)
int i, a[1024 * 1024], x = 0;
for (i= 0; i < 1024; i++)
x + = a[i] + a[1024* i];
what will be the physical memory size here?and how many bits should we assign for physical memory addressing?
