This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: memory access (i.e., to the page table AND the target data itself). Brieﬂy explain each answer and list the checks that determine whether the read access is valid and permitted. You may use the notation FOO[i. .j] to be the number formed by selecting bits i through j from FOO as bits i-j through 0 of the result, where bit 0 is the lowest order bit. For example, 101101[4. .2] = 011 = 310. 1 5. Repeat question 4, with the following changes to the VM system • two-level page table with 1024 entries in the level-one page table • PDE[i] = page directory entry at physical address i with same ﬁelds as PTE[i] 6. Compare the replacement mechanisms of set-associative caches and virtual memory by describing the algorithm each uses and justifying why this algorithm is a good choice for that problem, but not for the other. 2...
View Full Document
This note was uploaded on 10/09/2011 for the course CPSC 344 taught by Professor Karen during the Fall '10 term at UBC.
- Fall '10