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

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Hybrid (LRU) Page-Replacement Algorithm

by Pooja Khulbe, Shruti Pant
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 91 - Number 16
Year of Publication: 2014
Authors: Pooja Khulbe, Shruti Pant
10.5120/15966-5350

Pooja Khulbe, Shruti Pant . Hybrid (LRU) Page-Replacement Algorithm. International Journal of Computer Applications. 91, 16 ( April 2014), 25-28. DOI=10.5120/15966-5350

@article{ 10.5120/15966-5350,
author = { Pooja Khulbe, Shruti Pant },
title = { Hybrid (LRU) Page-Replacement Algorithm },
journal = { International Journal of Computer Applications },
issue_date = { April 2014 },
volume = { 91 },
number = { 16 },
month = { April },
year = { 2014 },
issn = { 0975-8887 },
pages = { 25-28 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume91/number16/15966-5350/ },
doi = { 10.5120/15966-5350 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:12:55.019022+05:30
%A Pooja Khulbe
%A Shruti Pant
%T Hybrid (LRU) Page-Replacement Algorithm
%J International Journal of Computer Applications
%@ 0975-8887
%V 91
%N 16
%P 25-28
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In this paper, a new page replacement algorithm has been represented that has a better performance in average than quondam methods. A major attempt in such an algorithm is to substitute characteristics of some quondam methods engrossed by a new idea. The key concept of proposed scheme is to decrease overall page fault rate for system i. e. to increase the hit ratio of pages. In brief this paper remonstrate an advanced version of Least recently used algorithm , which is referred as Hybrid LRU. The general idea behind Hybrid LRU is to keep track of the total number of references and whenever a page is scrawled ( modified to) , a modified bit M will be set for that particular page.

References
  1. 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.
  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. Kim, K. , Park, K. , "Least Popularity – Per – Byte Replacement Algorithm for a Proxy Cache ", IEEE, pp. 780 – 787,2001.
  4. S. M. Shamsheer Daula, Dr. K. E Sreenivasa Murthy, G Amjad Khan. , "A Throghput Analysis on page replacement algorithm",International Journal of Engineering Research and Applications (IJERA), ISSN: 2248-9622, Vol. 2, Issue 2, pp. 126-13, Mar-Apr 2012.
  5. Jaafar Alghazo, Adil Akaaboune, and Nazeih Botros. Sf-lru cache replacement algorithm. In MTDT, pages 19-24. IEEE Computer Society, 2004
  6. Donghee Lee, Jongmoo Choi, Jong-Hun Kim, Sam H. Noh, Sang Lyul Min, Yookun Cho, and Chong-Sang Kim. Lrfu: A spectrum of policies that subsumes the least recently used and least frequently used policies. IEEE Trans. Computers, 50(12):1352-1361, 2001.
  7. Andrew S. Tanenbaum. Modern Operating Systems. Prentice-Hall, 1992
Index Terms

Computer Science
Information Sciences

Keywords

Hit ratio LRU Algorithm Page Replacement HYBRID(LRU) Page replacement algorithm

Powered by PhDFocusTM