HOMEWORK #4

CSE 410 Fall 98

Due: Monday November 9, in class

Questions 1-5: [PH] text, pp.628-631, 7.2, 7.6, 7.7, 7.20, 7.24

6. Consider the 2-way set associative cache example presented in class. An address has 16 bits, with an 8-bit tag, 4-bit set number, and 4-bit offset. Assume that each set in the cache also has an LRU bit used to implement an LRU replacement strategy. A program has the following execution trace or reference string, giving its memory references expressed in hexadecimal:

0010    0012    0014    0020    0022    0016    0020    641C
641E    0024    6514    6520    6422    6424    0010

Show the contents of the cache after each reference. Assume that the cache is empty initially (all entries invalid).