ModelingPageReplacementAlgorithms.pptVIP

Modeling Page Replacement Algorithms Reference text: Tanenbaum ch.4.5 Belady Anomaly Page fault rate gives some info on how paging is doing Compare page replacement algorithms by running the same workload and look at page fault rate using vmstat -s The anomaly Adding more physical memory increases the number of page faults reason: the poor FIFO page replacement algorithm Illustration of the Belady Anomaly FIFO with 3 page frames FIFO with 4 page frames Pages are referenced(the reference string):  0 1 2 3 0 1 4 0 1 2 3 4 Ps show which page references show page faults Use LRU Algorithm 10 PF’s compared to 9 with FIFO FIFO keeps “4” in memory because it comes in last Even a bad algorithm shines under the right circumstances Youngest page Oldest page Page Reference Order Stack Algorithms A paging system is characterized by: the reference string the page replacement algorithm number of pages stored in memory(m) A LRU Page Replacement example (page fault=11 for m=4) Pages in memory (m) Total # of virtual Pages (n) Stack Algorithms (cont’d) Properties of LRU algorithm the referenced page always move to the top entry of array M if the referenced page is in memory, all pages above it move down by one position pages below the referenced page are not moved Belongs to a class of algorithms that M(m,r), the set of pages in memory at step r of a reference string, satisfies: M(m, r) ? M(m+1, r) where m = pages in memory r = index to the reference string Examples Because M(m,r) is always a subset of M(m+1,r), one more page of physical memory can cause additional pages to be stored in memory, not drop any. For the Belady sequence, M(3,7) ={0,1,4}, M(4,7) = {1,2,3,4}. FIFO is not a stack algorithm For the LRU algorithm, M(4,14)={5,3,7,4}, M(5,14) = {5,3,7,4,6}. LRU is a stack algorithm. Page fault=9 for m =5 m=5 Distance Strings Represent page reference by distance strings- distance from the top of the stack where the reference page was located For ex