Searched hist:10263 (Results 1 - 6 of 6) sorted by relevance

/gem5/src/mem/cache/tags/
H A DSConscriptdiff 10263:c00b5ba43967 Mon Jul 28 00:23:00 EDT 2014 Anthony Gutierrez <atgutier@umich.edu> 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()
H A DTags.pydiff 10263:c00b5ba43967 Mon Jul 28 00:23:00 EDT 2014 Anthony Gutierrez <atgutier@umich.edu> 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()
H A Dbase_set_assoc.cc10263:c00b5ba43967 Mon Jul 28 00:23:00 EDT 2014 Anthony Gutierrez <atgutier@umich.edu> 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()
H A Dbase_set_assoc.hh10263:c00b5ba43967 Mon Jul 28 00:23:00 EDT 2014 Anthony Gutierrez <atgutier@umich.edu> 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()
/gem5/src/mem/cache/
H A Dcache.ccdiff 10263:c00b5ba43967 Mon Jul 28 00:23:00 EDT 2014 Anthony Gutierrez <atgutier@umich.edu> 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()
H A Dbase.ccdiff 10263:c00b5ba43967 Mon Jul 28 00:23:00 EDT 2014 Anthony Gutierrez <atgutier@umich.edu> 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()

Completed in 82 milliseconds