This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: misses on a cache of size i on algorithm A . (For a better visual eﬀect, plot the outcome of each algorithm in a diﬀerent color, and provide a legend.) 1 See page 43 of the notes for the description of these algorithms. 1 Part B 1. For a general i , provide a sequence of page requests that illustrates Belady’s Anomaly incurred by FIFO on cache sizes i and i + 1. In your analysis, assume that the cache is initially empty. 2. Show that FWF is a marking algorithm, and that FIFO is not a marking algorithm. 3. We say that a page replacement algorithm ALG is conservative if it satisﬁes the fol-lowing condition: On any consecutive input subsequence containing k or fewer distinct page requests, ALG will incur k or fewer page faults. Prove that LRU and FIFO are conservative, but FWF is not. 2...
View Full Document
This note was uploaded on 02/10/2009 for the course RLG 100 taught by Professor Pearly during the Spring '08 term at University of Toronto.
- Spring '08