Editing Cache replacement policies (section)

===== Dynamic RRIP (DRRIP) =====

DRRIP<ref name=":0" /> uses set dueling<ref>{{Cite journal |last1=Qureshi |first1=Moinuddin K. |last2=Jaleel |first2=Aamer |last3=Patt |first3=Yale N. |last4=Steely |first4=Simon C. |last5=Emer |first5=Joel |date=2007-06-09 |title=Adaptive insertion policies for high performance caching |url=https://doi.org/10.1145/1273440.1250709 |journal=ACM SIGARCH Computer Architecture News |volume=35 |issue=2 |pages=381–391 |doi=10.1145/1273440.1250709 |issn=0163-5964}}</ref> to select whether to use SRRIP or BRRIP. It dedicates a few sets (typically 32) to use SRRIP and another few to use BRRIP, and uses a policy counter which monitors set performance to determine which policy will be used by the rest of the cache.