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 ?
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.