4. Consider the Translation Lookaside Buffer (TLB) and page table below. Assume that accessing a page...

 

 

Transcribed Image Text:

4. Consider the Translation Lookaside Buffer (TLB) and page table below. Assume that accessing a page that is NOT in the TLB replaces the Least Recently Used entry in the TLB and that the TLB is fully associative. Follow the trace below and fill in whether each access is a TLB hit or miss and whether it produces a page hit or page fault. Assume that moving a page into main memory does not require replacing another page (i.e., memory is large enough to accommodate the entire program; but not all pages have been loaded yet). (10 points) Table 1: Page Table Virtual Page # Physical Page # In Memory No 2 18 Yes 3 Yes 4 7. No 16 Yes 6. 6. No 11 No 8 15 No Table 2: Translation Lookaside Buffer Virtual Page # Physical Page Valid 3 2 5. 16 6. 7. Toble 2: Translation Lookaside Buffer Virtual Page# Physical Page#Valid 3. 16 1 7. Trace TLB Hit/Miss Page Hit/Miss 3 4. 5 3. 4. Consider the Translation Lookaside Buffer (TLB) and page table below. Assume that accessing a page that is NOT in the TLB replaces the Least Recently Used entry in the TLB and that the TLB is fully associative. Follow the trace below and fill in whether each access is a TLB hit or miss and whether it produces a page hit or page fault. Assume that moving a page into main memory does not require replacing another page (i.e., memory is large enough to accommodate the entire program; but not all pages have been loaded yet). (10 points) Table 1: Page Table Virtual Page # Physical Page # In Memory No 2 18 Yes 3 Yes 4 7. No 16 Yes 6. 6. No 11 No 8 15 No Table 2: Translation Lookaside Buffer Virtual Page # Physical Page Valid 3 2 5. 16 6. 7. Toble 2: Translation Lookaside Buffer Virtual Page# Physical Page#Valid 3. 16 1 7. Trace TLB Hit/Miss Page Hit/Miss 3 4. 5 3.

Answer rating: 100% (QA)

Trace TLB PAGE 3 HIT HIT ... View the full answer