Abstract
This paper introduces the Mockingjay cache replacement policy, which advances the state-of-the-art by producing single-core performance that approaches that of Bélády’s MIN policy, and which does so with a surprisingly simple solution. The basic idea is to predict a line’s reuse distance so that when a line is inserted into the LLC, its ETA (Estimated Time of Arrival) can be computed. Lines are then evicted based on their ETA ordering. This paper describes the Mockingjay policy and explains the key ideas that make it successful.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
