The project will develop an in – memory object cache utilizing the LRU (least-recently-used) algorit

The cache will store the objects that are most accessed within a fixed size memory pool. Thus system is keep statistics and calculates tradeoffs (i.e. one large object vs. smaller objects). Requests for pages are first directed to the cache and, if the page is not in the cache, then to the auxiliary memory. In the latter case, a copy of the page is saved into the cache. If the cache is full, one of the pages in the cache must be eliminated. LRU (least-recently-used) algorithm replaces the least recently used page from the cache. This system has two service methods like “Add Service” and “Get Service” and two application methods like “remove()” and “LRU()”.

PriorityQueueApp.java
myCompare.java
Obj.java