(30 points) Consider a Direct-Mapped cache organization with the capacity of 4 blocks. Show the content of the cache and the content of the memory locations for each block after each access. As a notation, for each access, the word Read/Write followed by a number indicates the type of access for that block number. For example, Read 5 indicates that the cache needs to read a word within block 5. As a further notation, a modification (write) to a block is indicated by superscripting it with the prime character. For example, the first modification to block 5 is indicated as 5, the second as 5, etc. Assuming that Write-Allocate and Write-Through are used, show the content of cache and memory after each access. If an entry is left blank, it is assumed that the value of the entry will be the block that occupied the entry most recently

The table below is for question 2.

2. (30 points) Repeat the same problem for the following table, assuming write-back and no write-allocate are used. Also, assume the cache is 2-way set-associative and the replacement algorithm is LRU. Note: At each set access (whether read or write) both blocks must be shown.

Block Access

C0

C1

C2

C3

M0

M1

M3

M4

M5

M6

M7

M8

M9

M11

Read 9

Read 5

Write 9

Write 7

Read 5

Read 7

Write 6

Read 3

Write 7

Read 3

Read 11

Write 1

Read 1