LRU implementation

Use a Doubly Linked list + Hashtable, similar to the implementation of LinkedHAshMap in Java.
The Hash table will point to a node in the linked list.
Every time a page block, n,  is accessed,
  Go to the hashtable with n
  Get the node pointer
  Bring that node to the head of the doubly linked list