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

Histogram based Analysis of Page Replacement Techniques

by Ruchin Gupta
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 32 - Number 4
Year of Publication: 2011
Authors: Ruchin Gupta
10.5120/3889-5443

Ruchin Gupta . Histogram based Analysis of Page Replacement Techniques. International Journal of Computer Applications. 32, 4 ( October 2011), 1-7. DOI=10.5120/3889-5443

@article{ 10.5120/3889-5443,
author = { Ruchin Gupta },
title = { Histogram based Analysis of Page Replacement Techniques },
journal = { International Journal of Computer Applications },
issue_date = { October 2011 },
volume = { 32 },
number = { 4 },
month = { October },
year = { 2011 },
issn = { 0975-8887 },
pages = { 1-7 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume32/number4/3889-5443/ },
doi = { 10.5120/3889-5443 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:18:15.431137+05:30
%A Ruchin Gupta
%T Histogram based Analysis of Page Replacement Techniques
%J International Journal of Computer Applications
%@ 0975-8887
%V 32
%N 4
%P 1-7
%D 2011
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Modern operating systems use virtual memory concept because of its advantages but they use different page replacement techniques .An efficient page replacement technique is required so as to produce minimum number of page faults. Some of the page replacement techniques are FIFO, LRU, OPTIMAL etc.Optimal has been proven to be best producing minimum number of page faults .LRU approximates optimal. Considerable research has been done to evaluate theses policies and to develop new ones based on recency, frequency, token, and locality model parameters etc.This paper uses a histogram based approach to compare FIFO, LRU, LRU2, OPTIMAL policies. Simulation results show that histograms for all policies equalize as the number of frames increases. Also histogram for optimal policy equalizes more rapidly then other policy’s histograms. Also pages of large frequency of occurrences contribute much to the total number of page faults in both LRU and optimal page replacement algorithms.

References
  1. Abraham Silberschatz, Peter Baer, 1999, Operating System Concepts (5th Ed.).New York: John Wiley & Sons, Inc.
  2. Peter J. Denning, Working Sets Past and Present, 1980 IEEE.
  3. Ben Juurlink, Approximating the Optimal Replacement Algorithm, CF’04, April 14–16, 2004, ACM 1581137419/ 04/0004.
  4. Sedigheh Khajoueinejad, Mojtaba Sabeghi, Azam Sadeghzadeh, A Fuzzy Cache Replacement Policy and its Experimental Performance Assessment, 2006 IEEE.
  5. Song Jianga,, Xiaodong Zhangb,, Token-ordered LRU: an effective page replacement policy and its implementation in Linux systems, 2004 Elsevier.
  6. Elizabeth J. O'Neil1, Patrick E. O'Neil1, Gerhard Weikum, the LRU-K Page Replacement Algorithm For Database Disk Buffering, SIGMOD Washington, DC, USA 1993 ACM.
Index Terms

Computer Science
Information Sciences

Keywords

Operating system virtual memory page fault page replacement techniques histogram matlab

Powered by PhDFocusTM