This preview shows pages 1–2. Sign up to view the full content.
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 eect, plot the outcome of each algorithm in a dierent 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 Beladys 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 satises the following 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
 Spring '08
 Pearly

Click to edit the document details