CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

An Assessment of Hybrid LRU (H-LRU) with Existing Page Replacement Algorithms

by Pooja Khulbe, Sanjay Kumar, Nidhi Yadav
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 99 - Number 17
Year of Publication: 2014
Authors: Pooja Khulbe, Sanjay Kumar, Nidhi Yadav
10.5120/17469-8415

Pooja Khulbe, Sanjay Kumar, Nidhi Yadav . An Assessment of Hybrid LRU (H-LRU) with Existing Page Replacement Algorithms. International Journal of Computer Applications. 99, 17 ( August 2014), 51-53. DOI=10.5120/17469-8415

@article{ 10.5120/17469-8415,
author = { Pooja Khulbe, Sanjay Kumar, Nidhi Yadav },
title = { An Assessment of Hybrid LRU (H-LRU) with Existing Page Replacement Algorithms },
journal = { International Journal of Computer Applications },
issue_date = { August 2014 },
volume = { 99 },
number = { 17 },
month = { August },
year = { 2014 },
issn = { 0975-8887 },
pages = { 51-53 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume99/number17/17469-8415/ },
doi = { 10.5120/17469-8415 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:28:29.800152+05:30
%A Pooja Khulbe
%A Sanjay Kumar
%A Nidhi Yadav
%T An Assessment of Hybrid LRU (H-LRU) with Existing Page Replacement Algorithms
%J International Journal of Computer Applications
%@ 0975-8887
%V 99
%N 17
%P 51-53
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The goal of any page replacement algorithm is to reduce fault rate by selecting best victim page to remove. This paper presents a framework through which, we tried to compare our previous work i. e. H-LRU [1] with other existing algorithms and prove that it has a better performance in average than former methods. Our major attempt in this paper is to extend our previous work HLRU and to compare characteristics of some former methods with HLRU. The general idea behind the comparison is to evaluate the hit ratio of pages for different algorithms and to prove that it has the best performance among all . For this purpose we consider traditional algorithm like FIFO, LRU and some recent approaches like PRO-LRU, H-LRU.

References
  1. Pooja khulbe, Shruti pant, "HYBRID LRU Page Replacement Algorithm" , International Journal of Computer Applications (0975 – 8887) Volume 91 – No. 16, April 2014
  2. Ali Khosrozadeh, Sanaz Pashmforoush, Abolfazl Akbari,Maryam Bagheri, Neda Beikmahdavi. , "Presenting a Novel Page Replacement Algorithm Based on LRU" , Journal of Basic and Applied Scientific Research , 2(10)10377-10383, 2012.
  3. Kaveh Samiee, "WRP: Weighting Replacement Policy to Improve Cache Performance", International Journal of Hybrid Information Technology,Vol. 2,No. 2, April, 2009.
  4. O'Neil, J. E. , O'Neil, E. P. , Weikum, G. , "An Optimality Proof of the LRU-K Page Replacement Algorithm", Journal of the ACM, Vol. 46, No. 1, pp. 92- 112, January 1999.
  5. Amit S. Chavan, Kartik R. Nayak, Keval D. Vora, Manish D. Purohit and Pramila M. Chawan, "A Comparison of Page Replacement Algorithms" , IACSIT International Journal of Engineering and Technology, Vol. 3, No. 2, April 2011
Index Terms

Computer Science
Information Sciences

Keywords

Page Replacement LRU FCFS PRO-LRU H-LRU

Powered by PhDFocusTM