Part III: Set Associative Mapped Cache

Execute the above program by setting the following Parameters:

Number of sets $($Set Blocks$)$: $2$ way

Cache Type: Set Associative

Replacement: LRU$/$FIFO$/$Random

a$)$ Fill up the following table for three different replacement algorithms and state which replacement algorithm is better and why?

$\backslash$table$[[$Replacement Algorithm: Random$],[$Block Size,Cache size,Miss,Hit,Hit ratio$],[2,,,,],[2,8,,,],[2,16,,,],[2,32,,,],[2,64,,,],[$Replacement Algorithm: FIFO$],[$Block Size,Cache size,Miss,Hit,Hit ratio$],[2,,,,],[2,8,,,],[2,16,,,],[2,32,,,],[2,64,,,],[$Replacement Algorithm: LRU$],[$Block Size,Cache size,Miss,Hit,Hit ratio$],[2,4,,,],[2,8,,,],[2,16,,,],[2,32,,,],[2,64,,,]]$

b$)$ Plot the graph of Cache Hit Ratio Vs Cache size with respect to different replacement algorithms. Comment on the graph that is obtained.

c$)$ Fill in the following table and analyse the behaviour of Set Associative Cache. Which one is better and why?

$\backslash$table$[[$Replacement Algorithm: LRU$],[$Block Size,,Set Blocks,Miss,Hit,Hit ratio$],[$Cache size,,,,$],[2,64,2-$ Way,,,$],[2,64,4-$ Way,,,$],[2,64,8-$ Way,,,$]]$