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 - Math>
Summary
| 2024 ARGOS @ Christ's College | 12/14/2024 | Y | 1 | 10.00 | 100% | 0% | 0% |
| 2024 ARGOS @ Columbia | 11/23/2024 | Y | 1 | 10.00 | 100% | 0% | 0% |
| 2024 ARGOS @ Stanford | 02/22/2025 | Y | 1 | 30.00 | 100% | 100% | 100% |
| 2024 ARGOS Online | 03/22/2025 | Y | 1 | 10.00 | 100% | 0% | 0% |