Consider a system that has a 16KB address space and 64 byte pages in a two-level and that the page directory and the page table with entries as in the image below (taken from OSTEP ch. 20, Figure 20.5). Suppose also that PTEs and PDEs are 4 bytes each.

How much less memory is used for storing the multi-level page table, compared to a linear page table?

Consider a system that has a 16KB address space and 64 byte pages in a two-level and that the page directory and the page table with entries as in the image below (taken from OSTEP ch. 20, Figure 20.5). 

Translate the virtual address 0x0178 to a physical address

Consider a system that has a 16KB address space and 64 byte pages in a two-level and that the page directory and the page table with entries as in the image below (taken from OSTEP ch. 20, Figure 20.5). 

Translate the virtual address 0x0178 to a physical address

Consider a system that has a 16KB address space and 64 byte pages in a two-level and that the page directory and the page table with entries as in the image below (taken from OSTEP ch. 20, Figure 20.5). Suppose also that PTEs and PDEs are 4 bytes each.

How much less memory is used for storing the multi-level page table, compared to a linear page table?

Consider a system that has a 16KB address space and 64 byte pages in a two-level and that the page directory and the page table with entries as in the image below (taken from OSTEP ch. 20, Figure 20.5). 

Translate the virtual address 0x0178 to a physical address

Consider a system that has a 16KB address space and 64 byte pages in a two-level and that the page directory and the page table with entries as in the image below (taken from OSTEP ch. 20, Figure 20.5). Suppose also that PTEs and PDEs are 4 bytes each.

How much less memory is used for storing the multi-level page table, compared to a linear page table?

What is the average turnaround time (rounded to two decimal places) under SJF of the following workload?:

• Job A arrives at time 0s and needs to run on the CPU for 60s
• Job B arrives at time 5s and needs to run on the CPU for 10s
• Job C arrives at time 10s and needs to run on the CPU for 3s

Note: assume that switching between processes is instantaneous (i.e., takes no time). Also assume that if the scheduler is preemptive, then it can make the decision to switch between jobs at any given time (i.e., as soon as another process arrives)

Select the true statement about MLFQ schedulers from the options below: 

Direct execution of processes (without limits) has which of the following possible disadvantages? (Choose the best answer)

Assume that we are employing the cooperative approach to switch between processes running on the CPU (i.e., no timer interrupts). We have included a function yield() that allows the process to transfer control of the CPU to the operating system. Which of the following code segments can keep control of the CPU from the operating system indefinitely?