Beschreibung
A virtual memory system requires efficient page replacement algorithms to make a decision which pages to evict from memory in case of a page fault. Many algorithms have been proposed for page replacement. Each algorithm is used to decide on which free page frame a page is placed and tries to minimize the page fault rate while incurring minimum overhead. As newer memory access patterns were explored, research mainly focused on formulating newer approaches to page replacement which could adapt to changing workloads. We look at the traditional algorithms such as Optimal replacement, LRU, FIFO and also study the recent approaches such as NRU, Second Chance.This report attempts to propose a hybrid page replacement algorithms.
Autorenporträt
Pallab Banerjee received his B.Tech and M.Tech in Computer Science & Engineering from Biju Patnaik University of Technology. He is presently working as Asst.Professor in Amity University Jharkhand. Biresh Kumar received his MCA from Burdwan University and M.Tech from BIT Mesra.He is presently working as Asst. Professor in Amity University Jharkhand.
Herstellerkennzeichnung:
OmniScriptum SRL
Str. Armeneasca 28/1, office 1
2012 Chisinau
MD
E-Mail: info@omniscriptum.com
