Question
SLAT improves on the usage of “shadow” types of these structures for guest operating systems. For 10 points each:
[10m] Name these data structures, which map the virtual address space for an operating system to physical addresses in memory. Lookup in these structures can be improved by implementing them in a tree-like “multilevel” style.
ANSWER: (multilevel) page tables [prompt on tables] (SLAT stands for Second Level Address Translation.)
[10h] To save time, physical page numbers can be found by looking them up in this structure before the page table using the virtual page number. Misses to this cache-like structure result in a page walk in order to find the address.
ANSWER: translation lookaside buffer [or TLB]
[10e] Page walks due to a TLB miss are simple in one-level page tables because they are typically implemented with one-dimensional examples of this data structure, corresponding to fixed contiguous memory accessed with an index.
ANSWER: one-dimensional arrays
<Science - Other Science - Computer Science>
Summary
| 2024 ARGOS @ McMaster | 11/17/2024 | Y | 2 | 20.00 | 100% | 100% | 0% |
Data
| You cannot go to Aarhus to see his peat-brown head / With eyes like ripening fruit | Ryan Wesley Routh's 10 000 NATO-trained Afghan Quizbowlers | 10 | 0 | 10 | 20 |
| Simpson Agonistes: The Crisis of Donut | Moderator Can't Neg me While in Alpha | 10 | 0 | 10 | 20 |