ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

Proposed D-Range Page Replacement Algorithm

Journal: International Journal of Science and Research (IJSR) (Vol.5, No. 3)

Publication Date:

Authors : ;

Page : 1581-1583

Keywords : Hit ratio; LRU algorithm; FIFO; OPTIMAL; B tree; D-range page replacement algorithm;

Source : Downloadexternal Find it from : Google Scholarexternal

Abstract

In real world scenario, workload adaptation and easy implementation is of prime importance. The main idea behind this paper is to introduce a new page replacement algorithm which will take into consideration locality of reference periodically and save the time to search through all pages for reference bits. This gives more performance from traditional LRU after initial cycles and efficient implementation due to use of B tree. The key concept of this algorithm is to maintain range pages according to total no of references periodically which will remain in memory for a cycle. This greatly increases the hit ratio of pages.

Last modified: 2021-07-01 14:32:41