9.9 Consider a logical address space of 256 pages with a 4-KB page size, mapped onto a physical memory of 64 frames. a. How many bits are required in the logical address? b. How many bits are required in the physical address?
Problem 2: (15 points)
9.21 (revised) Assuming a 4-KB page size (1KB = 1024B), what are the page numbers and offsets for the following address references (provided as decimal numbers)? a. 21205 b. 164250
Problem 3: (15 points)
9.23 Consider a logical address space of 2,048 pages with a 4-KB page size, mapped onto a physical memory of 512 frames. a. How many bits are required in the logical address? b. How many bits are required in the physical address?
Problem 4: (15 points)
9.16 (revised) On a system with paging, a process cannot access memory that it does not own. Why? How could the operating system allow access to additional memory?
Problem 5: (20 points)
9.24 (revised) Consider a computer system with a 32-bit logical address and 8-KB page size. The system supports up to 1 GB of physical memory. How many entries are there in a conventional, single-level page table.
Problem 6: (20 points)
9.25 Consider a paging system with the page table stored in memory. a. If a memory reference takes 50 nanoseconds, how long does a paged memory reference take? (Assume it takes only one memory reference to access the page table for completion of the address translation). b. If we add TLBs, and if 75 percent of all page-table references are found in the TLBs, what is the effective memory reference time? (Assume that finding a page-table entry in the TLBs takes 2 nanoseconds, if the entry is present.)