Question 5 [20 points]: Consider a 2-way set associative cache memory system in which:
Main memory size = 128 bytes
Cache memory size = 32 bytes
Block size = 4 bytes
Replacement algorithm: FIFO
Write policy: write-back and write-allocate
Note: Within a set, assume that main memory blocks are copied sequentially
Given that the cache is initially empty and that the following decimal memory addresses are referenced:
34 [Read], 109 [Write], 58 [Read], 81 [Write], 114 [Read],
112 [Read], 121 [Read], 25 [Write], 32 [Write], 112 [Write]
Map the memory blocks corresponding to the addresses to cache blocks and indicate whether hit or miss.
Note: You must use the decimal approach in solving this question and you must show all computations and comments. You must state the type of each miss.
Access Decimal Time address T1 T2 T3 T4 T5 T6 T7 Ts T9 T10
Block number
Cache Set
Comment
Cache: Set# Valid Bit 0 0 0 1 0 0 2 0 0 3 0 0
Dirty bit 0 0 0 0 0 0 0 0
Memory block in Cache
Access times