Journal IJCRT UGC-CARE, UGCCARE( ISSN: 2320-2882 ) | UGC Approved Journal | UGC Journal | UGC CARE Journal | UGC-CARE list, New UGC-CARE Reference List, UGC CARE Journals, International Peer Reviewed Journal and Refereed Journal, ugc approved journal, UGC CARE, UGC CARE list, UGC CARE list of Journal, UGCCARE, care journal list, UGC-CARE list, New UGC-CARE Reference List, New ugc care journal list, Research Journal, Research Journal Publication, Research Paper, Low cost research journal, Free of cost paper publication in Research Journal, High impact factor journal, Journal, Research paper journal, UGC CARE journal, UGC CARE Journals, ugc care list of journal, ugc approved list, ugc approved list of journal, Follow ugc approved journal, UGC CARE Journal, ugc approved list of journal, ugc care journal, UGC CARE list, UGC-CARE, care journal, UGC-CARE list, Journal publication, ISSN approved, Research journal, research paper, research paper publication, research journal publication, high impact factor, free publication, index journal, publish paper, publish Research paper, low cost publication, ugc approved journal, UGC CARE, ugc approved list of journal, ugc care journal, UGC CARE list, UGCCARE, care journal, UGC-CARE list, New UGC-CARE Reference List, UGC CARE Journals, ugc care list of journal, ugc care list 2020, ugc care approved journal, ugc care list 2020, new ugc approved journal in 2020, ugc care list 2021, ugc approved journal in 2021, Scopus, web of Science.
How start New Journal & software Book & Thesis Publications
Submit Your Paper
Login to Author Home
Communication Guidelines

WhatsApp Contact
Click Here

  Published Paper Details:

  Paper Title

PERFORMANCE IMPROVEMENT OF LRU PAGE REPLACEMENT ALGORITHM

  Authors

  Greetta Pinheiro,  Madhubala Rathore

  Keywords

Least Recently Used Page Replacement Algorithm, Optimal page replacement Algorithm, Main Memory, Cache Memory, Doubly Circular Linked List, Splay Trees, Hash Tables, Skip list

  Abstract


The performance of the page replacement algorithms can be improved by augmenting it with some data along with the algorithm design. This can indeed optimize the time taken for the swapping process. In this system we are augmenting two data structures with LRU page replacement algorithm, they are doubly circular linked list and hash table. Doubly circular linked list is used because the traversal between the nodes is easier and faster. Hashing is more efficient in performing optimal searches and retrievals because it increases speed, better ease of transfer, better retrieval and reduce overhead. Furthermore Hashing can reduce disk space and access time by inserting and retrieving a page from the main memory in only one seek. Further we are comparing the performance of the classical LRU page replacement algorithm with the augmented LRU page replacement algorithm in terms of runtime.

  IJCRT's Publication Details

  Unique Identification Number - IJCRT2103050

  Paper ID - 203944

  Page Number(s) - 397-400

  Pubished in - Volume 9 | Issue 3 | March 2021

  DOI (Digital Object Identifier) -    http://doi.one/10.1729/Journal.26096

  Publisher Name - IJCRT | www.ijcrt.org | ISSN : 2320-2882

  E-ISSN Number - 2320-2882

  Cite this article

  Greetta Pinheiro,  Madhubala Rathore,   "PERFORMANCE IMPROVEMENT OF LRU PAGE REPLACEMENT ALGORITHM", International Journal of Creative Research Thoughts (IJCRT), ISSN:2320-2882, Volume.9, Issue 3, pp.397-400, March 2021, Available at :http://www.ijcrt.org/papers/IJCRT2103050.pdf

  Share this article

  Article Preview

  Indexing Partners

indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
Call For Paper May 2024
Indexing Partner
ISSN and 7.97 Impact Factor Details


ISSN
ISSN
ISSN: 2320-2882
Impact Factor: 7.97 and ISSN APPROVED
Journal Starting Year (ESTD) : 2013
ISSN
ISSN and 7.97 Impact Factor Details


ISSN
ISSN
ISSN: 2320-2882
Impact Factor: 7.97 and ISSN APPROVED
Journal Starting Year (ESTD) : 2013
ISSN
DOI Details

Providing A Free digital object identifier by DOI.one How to get DOI?
For Reviewer /Referral (RMS) Earn 500 per paper
Our Social Link
Open Access
This material is Open Knowledge
This material is Open Data
This material is Open Content
Indexing Partner

Scholarly open access journals, Peer-reviewed, and Refereed Journals, Impact factor 7.97 (Calculate by google scholar and Semantic Scholar | AI-Powered Research Tool) , Multidisciplinary, Monthly, Indexing in all major database & Metadata, Citation Generator, Digital Object Identifier(DOI)

indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer
indexer