Extra Credit 5

CMSC 411 / Olano, Spring 2012

Create a simulation similar to the one for Extra Credit 4, but this time for a four 2-way associative 4-byte cache lines with a least-recently used replacement strategy. You'll need two valid bits, two dirty bits, two tags, and two sets of data per cache block. You'll also need at least one reference bit so you can track which block is least recently used.

Note that this problem, and both problems for extra credit 4 are all different variations with a 32-byte total cache size.

Create a directory called ec5 in your class cvs directory, and submit your code there.