mem: refactor LRU cache tags and add random replacement tags
authorAnthony Gutierrez <atgutier@umich.edu>
Mon, 28 Jul 2014 16:23:23 +0000 (12:23 -0400)
committerAnthony Gutierrez <atgutier@umich.edu>
Mon, 28 Jul 2014 16:23:23 +0000 (12:23 -0400)
commita628afedade8d7b7cab108a81e714fc2755b4af3
tree82ed5c90e74e3e3e0038e418c1281517ea55f62e
parent0ac462459522771c7836f5f53e82c6a679c256ca
mem: refactor LRU cache tags and add random replacement tags

this patch implements a new tags class that uses a random replacement policy.
these tags prefer to evict invalid blocks first, if none are available a
replacement candidate is chosen at random.

this patch factors out the common code in the LRU class and creates a new
abstract class: the BaseSetAssoc class. any set associative tag class must
implement the functionality related to the actual replacement policy in the
following methods:

accessBlock()
findVictim()
insertBlock()
invalidate()
src/mem/cache/base.cc
src/mem/cache/cache.cc
src/mem/cache/tags/SConscript
src/mem/cache/tags/Tags.py
src/mem/cache/tags/base_set_assoc.cc [new file with mode: 0644]
src/mem/cache/tags/base_set_assoc.hh [new file with mode: 0644]
src/mem/cache/tags/lru.cc
src/mem/cache/tags/lru.hh
src/mem/cache/tags/random_repl.cc [new file with mode: 0644]
src/mem/cache/tags/random_repl.hh [new file with mode: 0644]