mem-cache: Add the DRRIP replacement policy

Instantiate the Dynamic Re-Reference Interval Prediction, as defined
in "High Performance Cache Replacement Using Re-Reference Interval
Prediction (RRIP)", by Jaleel et al.

Change-Id: Id1d354c01e63ae49739263647ff25e5665f60d8c
Signed-off-by: Daniel R. Carvalho <odanrc@yahoo.com.br>
Reviewed-on: https://gem5-review.googlesource.com/c/public/gem5/+/37898
Tested-by: kokoro <noreply+kokoro@google.com>
Reviewed-by: Bobby R. Bruce <bbruce@ucdavis.edu>
Maintainer: Bobby R. Bruce <bbruce@ucdavis.edu>

src/mem/cache/replacement_policies/ReplacementPolicies.py

@@ -100,6 +100,16 @@ class BRRIPRP(BaseReplacementPolicy):
 class RRIPRP(BRRIPRP):
     btp = 100
 
+class DRRIPRP(DuelingRP):
+    # The constituency_size and the team_size must be manually provided, where:
+    #     constituency_size = num_cache_entries /
+    #         (num_dueling_sets * num_entries_per_set)
+    # The paper assumes that:
+    #     num_dueling_sets = 32
+    #     team_size = num_entries_per_set
+    replacement_policy_a = BRRIPRP()
+    replacement_policy_b = RRIPRP()
+
 class NRURP(BRRIPRP):
     btp = 100
     num_bits = 1