HYBRID PAGE REPLACEMENT ALGORITHM IN REAL TIME SYSTEMS - Banerjee, Pallab;Kumar, Biresh
26,99 €
inkl. MwSt.
Versandkostenfrei*
Versandfertig in 6-10 Tagen
  • Broschiertes Buch

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…mehr

Andere Kunden interessierten sich auch für
Produktbeschreibung
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 recibió su B.Tech y M.tech en Ingeniería Informática de la Universidad Tecnológica de Biju Patnaik. Actualmente trabaja como profesor adjunto en la Universidad Amity de Jharkhand. Biresh Kumar recibió su MCA de la Universidad de Burdwan y su M.Tech del BIT Mesra. Actualmente trabaja como profesor adjunto en la Universidad Amity de Jharkhand.