- +---------------------------+
- | CS 140 |
- | PROJECT 3: VIRTUAL MEMORY |
- | DESIGN DOCUMENT |
- +---------------------------+
+ +---------------------------+
+ | CS 140 |
+ | PROJECT 3: VIRTUAL MEMORY |
+ | DESIGN DOCUMENT |
+ +---------------------------+
---- GROUP ----
>> preparing your submission, other than the Pintos documentation, course
>> text, lecture notes, and course staff.
- PAGE TABLE MANAGEMENT
- =====================
+ PAGE TABLE MANAGEMENT
+ =====================
---- DATA STRUCTURES ----
---- ALGORITHMS ----
->> A2: In a few paragraphs, describe your code for locating the frame,
->> if any, that contains the data of a given page.
+>> A2: In a few paragraphs, describe your code for accessing the data
+>> stored in the SPT about a given page.
>> A3: How does your code coordinate accessed and dirty bits between
>> kernel and user virtual addresses that alias a single frame, or
>> A5: Why did you choose the data structure(s) that you did for
>> representing virtual-to-physical mappings?
- PAGING TO AND FROM DISK
- =======================
+ PAGING TO AND FROM DISK
+ =======================
---- DATA STRUCTURES ----
>> where your design falls along this continuum and why you chose to
>> design it this way.
- MEMORY MAPPED FILES
- ===================
+ MEMORY MAPPED FILES
+ ===================
---- DATA STRUCTURES ----
>> implementation either does or does not share much of the code for
>> the two situations.
- SURVEY QUESTIONS
- ================
+ SURVEY QUESTIONS
+ ================
Answering these questions is optional, but it will help us improve the
course in future quarters. Feel free to tell us anything you