"Figure 5.7" in the statement is show below. This picture is from Computer Architecture: A Quantitive Approach Write-back blockWrite missfor blockCPU write hitCPU read hitInvalidPlace write miss on busCPU writeWrite miss for this blockInvalidate for this blockExclusive(read/write)CPU readPlace read miss on busCPU read missWrite-back data; place read miss on busCPU writeRead miss for block Write-back blockPlace invalidate on busCPU write missCPU write missPlace write miss on busWrite-back dataPlace write miss on busCPUreadhitShared(read only)CPUreadmissPlace readmiss on busFigure 5.7 Cache coherence state diagram with the state transitions induced by thelocal processor shown in black and by the bus activities shown in gray. As inFigure 5.6, the activities on a transition are shown in bold. Problem 2Complete the following table, filling in the state transitions specificallyfor Processor 1, block Assume a cache with a write-back policy (cache can hold only oneblock at a time) which is initially empty. Include the new state of block A in Processor 1 onlyafter each event, and note any external actions taken by Processor 1. Assume that these accessesoccur in order, and that no other traffic occurs at the same time. Here, ESI refers to the standardsnoopy protocol in Figure 5.7 (page 361), whereas MESI is the modified snoopy protocol in thelecture slide which uses an additional state. Please note that M (modified) state in MESI is infact similar to the E (exclusive) state in ESI, and E (exclusive) state in MESI is anadditional (read/only) state. To avoid this confusion, some literature uses the term MSI to referto ESI protocol.EventLocal Write ALocal Read BBus Read ABus Write ALocal Write ALocal Read ABus Read ALocal Write ALocal Write BLocal Read ALocal Write ALocal Write BESI forblock AEMESI forblock AMExternal actions for ESI and MESIBoth send invalidations

LOAD read B. In the cache, there is A because of previous instructions. Therefore, this is a…

Problem Complete the following table, filling in the state transitions specifically for Processor 1, block A. Assume a cache with a write-back policy (cache can hold only one block at a time) which is initially empty. Include the new state of block A in Processor 1 only after each event, and note any external actions taken by Processor 1. Assume that these accesses occur in order, and that no other traffic occurs at the same time. Here, ESI refers to the standard snoopy protocol in Figure 5.7 (page 361), whereas MESI is the modified snoopy protocol in the lecture slide which uses an additional state. Please note that M (modified) state in MESI is in fact similar to the E (exclusive) state in ESI, and E (exclusive) state in MESI is an additional (read/only) state. To avoid this confusion, some literature uses the term MSI to refer to ESI protocol.