Briefly explain: how does a multi-level page table save memory?
Suppose a machine does not use a multi-level page table. Suppose further, that the system uses a 54-bit virtual address and a 30-bit physical address. If the page size is 16K, how many entries should you have in the page table? You may express the answer as a power of 2. (1) Is the decision to have a single level page table a reasonable one? Explain (2) If you are to use the inverted page table in this system, what...
The virtual memory system using demand paging, also provides memory protection. · Explain clearly (and briefly) how is protection achieved. · Show how the paging system determines when a page reference is an illegal page or a page not currently in memory.
3. Consider a paging system with the page table in memory. A. If a memory reference takes 100 nanoseconds, how long does a paged memory reference take? B. If we add TLBs, and 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 for the TLBs takes 20 nanoseconds.) C. It takes 750 milliseconds to service a page fault. The page fault rate is .001. What...
3. Consider a paging system with the page table in memory. A. If a memory reference takes 100 nanoseconds, how long does a paged memory reference take? B. If we add TLBs, and 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 for the TLBs takes 20 nanoseconds.) C. It takes 750 milliseconds to service a page fault. The page fault rate is .001. What...
Segment table is stored in MMU. 5. If the number of bits required for page number is 9 and the size of the page table entry is 4 bytes, then the page table size is 2KB. 6. In paging, external fragmentation reduces with increase in page size. 7. Multi-level page tables reduces the memory access time when compared to linear page table. 8. The number of levels in a multi-level page table increase with page size. 9. It is easier...
Explain your answer. True or False: If physical memory is 16MB, then the page table for process B has at most 256 entries if each page is 512KB.
36.-Assume a 32 bit memory space with 16[KB] pages/frames and a two-level page table. Answer the following questions: a).-what is the size of the page table in bytes needed for a process that has only 64[MB] of code at the start of its virtual address range? b).-how many bits are used for address (frame) offset, and how many for page table indexing (total). Assume each page table entry has 32 bits. a).-Size of page table b).-Offset bits b).-Page table indexing...
You have a processor that supports virtual memory. The page size used for the virtual memory is 16 KiBytes, The virtual address size is 24 bits. Each table entry is 2 bytes. How many pages will the processor support? ___ How big is the page table (assume a single level page table) ___
Problem 3 (25 points): Consider a paging system with the page table stored in memory. Ifa memory reference takes 200 nanoseconds, how long does a paged memory reference take? If we add associative registers, and 75 percent of all page-table references are found in the associative registers, what is the effective memory reference time? (Assume that finding a page-table entry in the associative registers takes zero time if the entry is there.) a. b.
Briefly explain HOW THREE BUSES CONNECTED TO MEMORY modules works to write or read data.