Try to make students think about performance of scheduler dispatching.

[pintos-anon] / doc / vm.tmpl

diff --git a/doc/vm.tmpl b/doc/vm.tmpl
index ea7349a67870fae46461ff774abc1d297bb7b57f..85e9d837967bcd8e7f382e48a354acce3d10009e 100644 (file)
--- a/doc/vm.tmpl
+++ b/doc/vm.tmpl
@@ -64,6 +64,10 @@ FirstName LastName <email@domain.example>
 >> frame must be evicted.  Describe your code for choosing a frame to
 >> evict.
 
+>> When a process P obtains a physical frame that was previously used
+>> by a process Q, how do you adjust the page table (and any other
+>> data structures) to reflect the physical frame Q no longer has?
+
 >> Explain your heuristic for deciding whether a page fault for an
 >> invalid virtual address should cause the stack to be extended into the
 >> page that faulted.
@@ -85,9 +89,9 @@ FirstName LastName <email@domain.example>
 
 >> Explain how you handle access to paged-out pages that occur during
 >> system calls.  Do you use page faults to bring in pages (as in user
->> programs), do you have a mechanism for "locking" pages into physical
->> memory, etc.?  How do you gracefully handle attempted accesses to
->> invalid virtual addresses?
+>> programs), or do you have a mechanism for "locking" pages into
+>> physical memory, or do you use some other design?  How do you
+>> gracefully handle attempted accesses to invalid virtual addresses?
 
 ---- RATIONALE ----