This chapter described the least recently used (LRU) replacement policy for multiway associative caches. Other, less common, replacement policies include first-in-first-out (FIFO) and random policies. FIFO replacement evicts the block that has been there the longest, regardless of how recently it was accessed. Random replacement randomly picks a block to evict.
(a) Discuss the advantages and disadvantages of each of these replacement policies.
(b) Describe a data access pattern for which FIFO would perform better than LRU.