LRU vs NFU - implementation issue
===

As I understand we use NFU, which is just approximation of [LRU][1], because LRU is hard to implementation in the "real world". 

But I don't understant why - this is just because the size of the matrix we use in LRU?


  [1]: http://en.wikipedia.org/wiki/Cache_algorithms#Least_Recently_Used