算法LRU，实现此算法需要多少位? [英] algorithm LRU, how many bits needed for implement this algorithm?

问题描述

我对算法LRU有点疑问.如果您有一个包含四个块的缓存，那么实现该算法需要多少位?

I have a little question about the algorithm LRU. If you have a cache with four blocs , how many bits do you need to implement this algorithm ?

推荐答案

http://www.powershow.com/view/95163-NzkyO/4_4_Page_replacement_algorithms_powerpoint_ppt_presentation ，其中讨论了各种页面替换方案.这也很好地解释了使用mxm矩阵的LRU实现.

There is a good slide-deck at http://www.powershow.com/view/95163-NzkyO/4_4_Page_replacement_algorithms_powerpoint_ppt_presentation that talks about various page replacement schemes. It also explains the LRU implementation using mxm matrix really well.

这篇关于算法LRU，实现此算法需要多少位?的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！