Generalized Tree-LRU Replacement

A generalization of the tree-LRU (pseudo-LRU, PLRU) method for cache line replacement selection in an N-way set-associative cache is described. In this method, a line is selected for replacement within a set using a logical multi-way tree, where the leaf nodes of the tree represent lines in a set, and where if the branching factor of a given node in the logical tree at a given level is k, then the state of the node is represented by one of k! (k factorial) logical states representing an access order of the nodes below the given node in the logical tree. Results showing the degree to which these methods approximate LRU replacement are presented.

By: John T. Robinson

Published in: RC23332 in 2004


This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.


Questions about this service can be mailed to .