diff --git a/src/mem/cache/replacement_policies/ReplacementPolicies.py b/src/mem/cache/replacement_policies/ReplacementPolicies.py
index 0bbf1d16bd..f40d1459ba 100644
--- a/src/mem/cache/replacement_policies/ReplacementPolicies.py
+++ b/src/mem/cache/replacement_policies/ReplacementPolicies.py
@@ -85,10 +85,10 @@ class BRRIPRP(BaseReplacementPolicy):
         "Percentage of blocks to be inserted with long RRPV")
 
 class RRIPRP(BRRIPRP):
-    btp = 0
+    btp = 100
 
 class NRURP(BRRIPRP):
-    btp = 0
+    btp = 100
     max_RRPV = 1
 
 class TreePLRURP(BaseReplacementPolicy):
diff --git a/src/mem/cache/replacement_policies/brrip_rp.hh b/src/mem/cache/replacement_policies/brrip_rp.hh
index 9374742c15..d3746644fe 100644
--- a/src/mem/cache/replacement_policies/brrip_rp.hh
+++ b/src/mem/cache/replacement_policies/brrip_rp.hh
@@ -66,6 +66,10 @@ class BRRIPRP : public BaseReplacementPolicy
     {
         /**
          * Re-Reference Interval Prediction Value.
+         * Some values have specific names (according to the paper):
+         * 0 -> near-immediate re-rereference interval
+         * max_RRPV-1 -> long re-rereference interval
+         * max_RRPV -> distant re-rereference interval
          * A value equal to max_RRPV + 1 indicates an invalid entry.
          */
         int rrpv;