General Structure Implementing LRU 'Cache Data

Which Data Structure Should be used for implementiong LRU cache?   


Pandit Gandharv
@[email protected] | Updated 19 Dec. 2018


A queue which is implemented using a doubly linked list. The maximum size of the queue will be equal to the total number of frames available (cache size). The most recently used pages will be near the front end and least recently pages will be near the rear end. A Hash with page number as key and address of the corresponding queue node as value.