From d207e9ccee411877fdeac80bb68a27900560f50f Mon Sep 17 00:00:00 2001 From: "Daniel R. Carvalho" Date: Mon, 19 Feb 2018 15:13:11 +0100 Subject: mem-cache: Split array indexing and replacement policies. Replacement policies (LRU, Random) are currently considered as array indexing methods, but have completely different functionalities: - Array indexers determine the possible locations for block allocation. This information is used to generate replacement candidates when conflicts happen. - Replacement policies determine which of the replacement candidates should be evicted to make room for new allocations. For this reason, they were split into different classes. Advantages: - Easier and more straightforward to implement other replacement policies (RRIP, LFU, ARC, ...) - Allow easier future implementation of cache organization schemes As now we can't assure the use of sets, the previous way to create a true LRU is not viable. Now a timestamp_bits parameter controls how many bits are dedicated for the timestamp, and a true LRU can be achieved through an infinite number of bits (although a few bits suffice in practice). Change-Id: I23750db121f1474d17831137e6ff618beb2b3eda Reviewed-on: https://gem5-review.googlesource.com/8501 Reviewed-by: Nikos Nikoleris Reviewed-by: Jason Lowe-Power Maintainer: Nikos Nikoleris --- src/mem/cache/tags/SConscript | 2 -- 1 file changed, 2 deletions(-) (limited to 'src/mem/cache/tags/SConscript') diff --git a/src/mem/cache/tags/SConscript b/src/mem/cache/tags/SConscript index 1412286a7..9758b566e 100644 --- a/src/mem/cache/tags/SConscript +++ b/src/mem/cache/tags/SConscript @@ -34,6 +34,4 @@ SimObject('Tags.py') Source('base.cc') Source('base_set_assoc.cc') -Source('lru.cc') -Source('random_repl.cc') Source('fa_lru.cc') -- cgit v1.2.3