Consider a paging system with the page table stored in memory. a. If a memory reference takes 400 nanoseconds, how long does a paged memory reference take? b. If we add TLBs, and 95 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 zero time, if the entry is there.)

Consider a paging system with the page table stored in memory. a. If a memory reference takes 400 nanoseconds, how long does a paged memory reference take? b. If we add TLBs, and 95 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 zero time, if the entry is there.)

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter6: System Integration And Performance

Section: Chapter Questions

Problem 12RQ

See similar textbooks

Similar questions

(b) Consider a paging system with the page table stored in memory. If a memory referencetakes 200 nano seconds, how long does a paged memory reference take? If we add a TLB,and 75% of all page references are found in the TLB, what is the effective memory referencetime? (Assume that it takes zero time to find an entry in the TLB if it is already present).
Consider a paging system with the page table stored in memory. Memory access takes 200 nanoseconds. If we add associative registers (a TLB), and 75 percent of all page table references are found in associative registers, then the effective memory reference time is__ns Assume that finding a page-table entry in the TLB takes zero time.
On a simple paging system with 224 bytes of physical memory, 256 pages of logical address space, and a page size of 210 bytes. 1. How many bits are needed to store an entry in the page table (how wide is the page table)? Assume a valid/invalid 1-bit is included in each entry. 2. If the page table is stored in the main memory with 250nsec access time, how long does a paged memory reference take? 3. If the page table is implemented using associative registers that takes 95nsec. and main memory that takes 200nsec, what is the total access time if 75% of all memory references find their entries in the associative registers?
4. Given that the main memory size is 32KB, the page size is 64B, the word size is 1B, and n-level paging is applied. What is the page number size? If (5, 10) is a record in the outer page table stored in PCB and (9, 7) is a record in the inter page table stored in page frame No.10, what is the physical address of the logical address 0010101001000110 in HEX?
Consider a memory-management system based on paging. The total size of the physical address space 64 MB, Pages of size 4 KB, the Logical address space of 4GB. total number of pages are 16384, total number of frames are 16384 and the number of entries in a page table are 1048576.Now Calculate: a)Size of Page Table b) No of bits in Physical Address c) No of Bits in Logical Address
Suppose that a machine has 38-bit virtual addresses and 32-bit physical addresses.(a) What is the main advantage of a multilevel page table over a single-level one?(b) With a two-level page table, 16-KB pages, and 4-byte entries, how many bits should be allocated for the top-level page table field and how many for the next-level page table field? Explain.
Suppose that a machine has 42-bit virtual addresses and 32-bit physical addresses.{a} How much RAM can the machine support (each byte of RAM must be addressable)?{b} What is the largest virtual address space that can be supported for a process?{c} If pages are 2 KB, how many entries must be in a single-level page table?{d} If pages are 2 KB and we have a two-level page table where the first level is indexed by 15-bits, then how many entries does the first-level page table have?{e} With the same setup as part {d}, how many entries are in each second-level page table?{f} What is the advantage of using a two-level page table over single-level page table?
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?
It is given that on a system, on average, an instruction executes in 1 nano second. Suppose that it takes 20 micro seconds of processor time for page fault. While, it takes 300 micro seconds of disk time for reading and writing a single page. Suppose that on average 1/3 of the pages that need to be paged out are modified. What is the average number of instructions between page faults that would cause the disk to be busy doing page transfers all the time?
Consider a system with 36-bit addresses that employs both segmentation and paging. Assume each PTE and STE is 4-bytes in size Assume the largest possible segment table is 213 bytes and the largest possible page table is 216 bytes. How large is a page? How large in bytes is the largest possible segment? please explain and don't paste the quizlet picture
consider you are looking at a virtual memory of size 1 GiB also a physical memory of size 128 KiB and a page size equal to 8 KiB. FIgure out how many bits are used to specify a virtual page number?
For our byte-addressable computer, we opted for a fully associative mapping that allows for 32 cache memory blocks and 16 bits for main memory addresses. If the size of each block is 16 bits, then the following is correct:Find out how many bytes the offset field takes up (a).(B) Measure the size of the tag field in pixels.