Improve the performance of LRU page replacement algorithm using augmentation of data structure

Abstract

The process takes less time for handling instructions then would be speedy and efficient. The speed of the process is not only depends on architectural features and operational frequency, but also depends on the algorithm and data structure, which is used for that process. There are many page replacement algorithms such as least recently used (LRU), first-in-first-out (FIFO), Optimal and the combination of LRU and least frequently used (LFU) are available in memory management. We can improve the performance of page replacement algorithm either develop a new algorithm from scratch or using augmentation of data structure and algorithm design. In this paper we use augmented doubly circular link list, skip list, splay tree and hash table and apply all these on LRU page replacement algorithm. We implement all these augmented data structure with LRU page replacement algorithm and traced using Standard Performance Evaluation Corporation (SPEC) benchmark files. This paper show that augmentation of data structure can improve the performance of LRU page replacement algorithm.