CS251 : CS251-Assign#5-W13.pdf
Document Summary
See the instructions regarding the deliverables for this assignment at the end of this document. Consider a sequence of memory address references given below. In the sequence, each word address is provided in both the decimal and binary formats. Below each address, the relative time at which these references occur is also listed. Bin 0000 0001 0010 0011 0100 0101 1010 1001. Bin 1100 0001 0100 1101 1001 1101 0000 1110. For direct-mapped cache: (memory address) modulo (number of blocks in cache) For n-way set associative cache: (memory address) modulo (number of sets in cache) For fully-associative cache: a word can be stored in any block. Now consider four different 8-word caches shown below. Assume that each of the four caches was used independently to facilitate memory access for the sequence above. For each cache type, assume that the cache is initially empty. To insert a word into a cache block or set, use the following formulas:
