Question

Here is a series of addresses in hexadecimal: 20, 3c, 10, 16, 20, 04, 28, 60, 10, 17 assume a lru replacement algorithm. for the four caches in problem 1, draw each cache as it would appear at the end of the series of references. include the valid bit, dirty bit, and tag. show the contents of the memory block using the byte address range such as m[20-23] for the word with address 22.

Answer 1

If there is a series of addresses in hexadecimal: 20, 3c, 10, 16, 20, 04, 28, 60, 10, 17 and it is assumed that an LRU replacement algorithm, then in order to solve the problem is to keep in mind that the two addresses included and be in the same set.