Pseudo LRU tree algorithm.
Posted
by patros
on Stack Overflow
See other posts from Stack Overflow
or by patros
Published on 2010-05-03T16:22:28Z
Indexed on
2010/05/03
19:48 UTC
Read the original article
Hit count: 664
A lot of descriptions of Pseudo LRU algorithms involve using a binary search tree, and setting flags to "point away" from the node you're searching for every time you access the tree.
This leads to a reasonable approximation of LRU. However, it seems from the descriptions that all of the nodes deemed LRU would be leaf nodes. Is there a pseudo-LRU algorithm that deals with a static tree that will still perform reasonably well, while determining that non-leaf nodes are suitable LRU candidates?
© Stack Overflow or respective owner