You are expected to do your own work on all homework assignments. You may (and are encouraged to) engage in general discussions with your classmates regarding the assignments, but specific details of a solution, including the solution itself, must always be your own work. (See the statement of Academic Dishonesty on the Syllabus)
Assignments need to be turned in via Laulima. Check the Syllabus for the late assignment policy for the course.
You should turn in single plain text file named README.txt with your answers to the assignment’s questions. Your file must be readable “as is” and points will be removed if the report is not readable.
Consider the following page table, in which “x” means an invalid entry.
------------------
logical | physical
------------------
| 15 | x |
| 14 | x |
| 13 | 7 |
| 12 | x |
| 11 | x |
| 10 | x |
| 9 | 2 |
| 8 | 1 |
| 7 | x |
| 6 | x |
| 5 | 6 |
| 4 | 5 |
| 3 | 9 |
| 2 | 11 |
| 1 | 8 |
| 0 | 13 |
------------------Assume a 8KiB page size. For convenience, in this exercise all physical and logical addresses are decimal values.
Give the physical address corresponding to the following logical addresses, or state that an error occurs (your answer should thus be decimal values and should include the details of how you performed the computation):
a. [5 pts] 20
b. [5 pts] 9100
c. [5 pts] 50321
d. [5 pts] 81589
Consider a logical address space of 32 pages with 2,048 bytes per page, mapped onto a physical memory of 8 frames.
a. [3 pts] How many bits are required in the logical address? (show your work)
b. [3 pts] How many bits are required in the physical address? (show your work)
Consider a computer system with a 32-bit logical address and 8-KiB page size. The system supports up to 2GiB of physical memory.
a. [4 pts] How many entries are there in a conventional single-level page table? (show your work)
b. [4 pts] How many entries are there in an inverted page table? (show your work)
Suppose we have a computer system with a 38-bit logical address, page size of 32KiB, and 8 bytes per page table entry.
a. [8 pts] How many pages are in the logical address space? (show your work)
b. [8 pts] Suppose we use two-level paging and arrange for all page table pages to fit into a single page frame. How will the bits of the address be divided up? (show your work)
c. [5 pts EXTRA CREDIT] Suppose we have a program with a 8GiB address space. Using the two-level page table scheme from the previous question, How much memory, in number of page frames, is used counting the process’s pages and the page table? (show your work, and the result should be a sum of three terms)