$3$ points each$)$ Let $($a$)$ word$1$ and word$2$ be in the same cache line fetched from block$\_$x in the main memory,

$($b$)$ word$3$ be in block$\_$y immediately following block$\_$x$,$ and $($c$)$ word$4$ be in a block$\_$z far away from

block$\_$x and block$\_$y$.$

The system uses a dynamic block prediction algorithm to predict which block is likely to be accessed very

soon and perfetches the predicted block. The algorithm predicts that one or more words in the block

immediately following the block currently being fetched $($of course due to a read$/$write miss$)$ will be needed

soon. It is assumed that copying a block from the main memory to the cache finishes before the next memory

reference. The following questions are independent of each other.

$2.$a Assume word$1$ is currently accessed. Which word can take the advantage of temporal locality?

i$.$ word$1$

ii$.$ word$2$

iii. word$3$

iv$.$ word$4$

v$.$ no word

$2.$b Assume word$2$ is currently accessed. Which word can take the advantage of spatial locality?

i$.$ word$1$

ii$.$ word$2$

iii. word$3$

iv$.$ word$4$

v$.$ no word

$2.$c Assume word$4$ is currently accessed. Which word can take the advantage of spatial locality?

i$.$ word$1$

ii$.$ word$2$

iii. word$3$

iv$.$ word$4$

v$.$ not word$1$ nor word$2$ nor word$3$ nor word$4$

$2.$d Assume word$4$ is currently accessed. Which word can take the advantage of temporal locality?

i$.$ word$1$

ii$.$ word$2$

iii. word$3$

iv$.$ word$4$

v$.$ not word$1$ nor word$2$ nor word$3$ nor word$4$

$2.$e Assume word$1$ is read and word$2$ is written. How many misses are there?

i$.1$ miss

ii$.2$ misses

iii. $3$ misses

iv$.$ no miss

$2.$f Assume word$2$ is read and word$3$ is written. How many misses are there?

i$.1$ miss

ii$.2$ misses

iii. $3$ misses

iv$.$ no miss