Consider a $4$-way set associative cache mapping, in which the cache blocks are grouped into sets and each set has $4$ blocks. There are $16$ cache blocks in total. The following memory block requests arrive in order when the cache memory is empty: $$ 8,4,8,3,0,7,12,64,216,8 $$ If a set is full, the Least Recently Used (LRU) policy is used to replace a block in that set to make room for the present request.
- Show the cache configuration (along with intermediate configurations) on meeting the above memory requirements.
- What is the hit ratio?