Question: Consider a 2-way set associative cache organization with the capacity of 8 blocks. Assume Write-Allocate and Write-back are used. Further, assume that the replacement algorithm

Consider a 2-way set associative cache organization with the capacity of 8 blocks. Assume Write-Allocate and Write-back are used. Further, assume that the replacement algorithm is LRU. Show the content of the cache and the content of the memory locations for each block after each access. If an entry is left blank in the memory portion, it is assumed that the value of the entry will be the block that occupied the entry most recently. For the cache portion, show both entries for any access to a set (read or write) - if no access is made to a set, the most recent values are assumed (so no need to repeat the entry) 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. The answer is suppose to go into a table with

Block Access C0 C1 C2 C3 M0 M1 M3 M4 M5 M6 M7 M8 M9 M11

Write 5

Write 8

Write 9

Write 7

Read 5

Write 5

Write 1

Read 3

Write 8

Read 0

Write 9

Write 4

Write 11

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!