Bowen Sun's Profile

That is, when a TLB miss fault occurs, the kernel should
check its own page table. If the page is not in memory, it should
read the page in from disk, set the page table entry to point to
the new page, install the page table entry, and resume the execution of
the user program. Of course, the kernel must first find space
in memory for the incoming page, potentially writing some other
page back to disk, if it has been modified.

random

You should use a single global inverted page table for all
processes. (This is a departure from the use of per-process page tables
from phase 2.) Because the inverted page table is global, each key
used to look up an entry in the table will need to contain both the
current process ID and the virtual page number. You may use the
standard Java java.util.Hashtable class to implement the
inverted page table, but do not depend upon the fact that this class
is synchronized to avoid changes being made to it by multiple threads.