25. A system implements a paged virtual address space for each process using a one-level page table. The maximum size of virtual address space is 16MB. The page table for the running process includes the following valid entries (the → notation indicates that a virtual page maps to the given page frame; that is, it is located in that frame): virtual page 2 → page frame 4 virtual page 4 → page frame 9 virtual page 1 → page frame 2 virtual page 3 → page frame 16 virtual page 0 → page frame 1 The page size is 1024 bytes and the maximum physical memory size of the machine is 2MB. a) How many bits are required for each virtual address? b) How many bits are required for each physical address? c) What is the maximum number of entries in a page table? d) To which physical address will the virtual address OX5F4 translate? e) Which virtual address will translate to physical address 0x400?

25. A system implements a paged virtual address space for each process using a one-level page table. The maximum size of virtual address space is 16MB. The page table for the running process includes the following valid entries (the → notation indicates that a virtual page maps to the given page frame; that is, it is located in that frame): virtual page 2 → page frame 4 virtual page 4 → page frame 9 virtual page 1 → page frame 2 virtual page 3 → page frame 16 virtual page 0 → page frame 1 The page size is 1024 bytes and the maximum physical memory size of the machine is 2MB. a) How many bits are required for each virtual address? b) How many bits are required for each physical address? c) What is the maximum number of entries in a page table? d) To which physical address will the virtual address OX5F4 translate? e) Which virtual address will translate to physical address 0x400?

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

A system implements a paged virtual address space for each process using a one-level page table. The maximum size of virtual address space is 16MB. The page table for the running process includes the following valid entries (the → notation indicates that a virtual page maps to the given page frame; that is, it is located in that frame): virtual page 2 → page frame 4 virtual page 1 → page frame 2 virtual page 0 → page frame 1 virtual page 4 → page frame 9 virtual page 3 → page frame 16The page size is 1024 bytes and the maximum physical memory size of the machine is 2MB.Q.) How many bits are required for each virtual address?
A system implements a paged virtual address space for each process using a one-level page table. The maximum size of virtual address space is 16MB. The page table for the running process includes the following valid entries (the → notation indicates that a virtual page maps to the given page frame; that is, it is located in that frame): virtual page 2 → page frame 4 virtual page 1 → page frame 2 virtual page 0 → page frame 1 virtual page 4 → page frame 9 virtual page 3 → page frame 16The page size is 1024 bytes and the maximum physical memory size of the machine is 2MB.Q.) Which virtual address will translate to physical address 0x400?
A system implements a paged virtual address space for each process using a one-level page table. The maximum size of virtual address space is 16MB. The page table for the running process includes the following valid entries (the → notation indicates that a virtual page maps to the given page frame; that is, it is located in that frame): virtual page 2 → page frame 4 virtual page 1 → page frame 2 virtual page 0 → page frame 1 virtual page 4 → page frame 9 virtual page 3 → page frame 16The page size is 1024 bytes and the maximum physical memory size of the machine is 2MB.Q.)To which physical address will the virtual address 0x5F4 translate?
In the S/370 architecture, a storage key is a control field associated with each page- sized frame of real memory. Two bits of that key that are relevant for page replace- ment are the reference bit and the change bit. The reference bit is set to 1 when any address within the frame is accessed for read or write, and is set to 0 when a new page is loaded into the frame. The change bit is set to 1 when a write operation is per- formed on any location within the frame. Suggest an approach for determining which page frames are least-recently-used, making use of only the reference bit.
A system implements a paged virtual address space for each process using a one-level page table. The maximum size of virtual address space is 16MB. The page table for the running process includes the following valid entries (the → notation indicates that a virtual page maps to the given page frame; that is, it is located in that frame): virtual page 2 → page frame 4 virtual page 1 → page frame 2 virtual page 0 → page frame 1 virtual page 4 → page frame 9 virtual page 3 → page frame 16The page size is 1024 bytes and the maximum physical memory size of the machine is 2MB.Q.)What is the maximum number of entries in a page table?
A processor uses 2-level page tables for virtal to physical address translation. Page tables for hoth levels are stored in the main memory, Virtual and physical addreses are both 12 bits wide. The memory is byte adressable. For virtual to physical address translation, the 10 most significant bits for the virmal address are used as index into the first level poge table while the next 10 bits are used as index into the second level page table. The 12 least significant bits of the virtual address are used as offset within the page. Assume that the page table entries in both levels of page tables are 4 bytes wide. Further, the processor has a translation look-aside a buffer (TLB), with a hit a rate of 96% The TLB caches recently used virtual page numbers and the corresponding physical page numbers The processor also has a physically addressed cache with a hit rate of 90%. Main memory access time is 10 ns, cache access time is 1 ns, and TLB access time is also 10 ns. 26. Assuming that no…
A system implements a paged virtual address space for each process using a one-level page table. The maximum size of virtual address space is 4MB. The page table for the running process includes the following valid entries (the - notation indicates that a virtual page maps to the given page frame, that is, it is located in that frame): Virtual page 2→ page frame 4 Virtual page 4→ page frame 9 Virtual page 1 page frame 2 Virtual page 3-→ page frame 16 Virtual page 0- page frame 1 The page size is 1024 bytes and the maximum physical memory size of the machine is 1MB. a) How many bits are required for each virtual address? type your answer. b) How many bits are required for each physical address? type your answer. c) What is the maximum number of entries in a page table? type your answer. d) What is the number of physical frames? type your answer. e) To which physical address will the virtual address Ox1173 translate? type your answer. f) Which virtual address will translate to physical…
A computer system has the segmented paging for virtual memory. The memory is byte addressable. Both virtual and physical address spaces contain 216 bytes each. The virtual address space is divided into 8 non-overlapping equal size segments. The memory management unit has a hardware segment table, each entry of which contains the physical address of the page table for the segment. Page tables are stored in the main memory and consists of 2 byte page table entries What is the minimum page size in bytes so that the page table for a segment requires at most one page to store it and also give the division of virtual address ?
Main memory size is 16 pages. Size of swap file on hard disk is 64 pages. Operating system locks down pages 0, 1, 2 and 7 in the main memory. Two programs are started and both are provided with a virtual address space of 10 pages. Initially operating system allocates 5 pages of main memory for each program and the rest from swap file. Virtual address space of each program starts from page 0. Construct page tables for both programs at program startup. A page table consists of P-bit which tells if the page is present in the main memory (1 = page is in main memory) and address of the page. Address tells either real address in main memory or the address of the page in swap file. b. A computer with a paged virtual memory system executes two load instructions that are adjacent to each other in memory. Describe the worst case scenario (in terms of performance) that can occur during the execution of the two instructions and explain under which conditions this case occurs. How does this affect…
A virtual memory has a page size of 2K(words). There are eight pagesand four blocks. The associative memory page table contains the followingentries:Page Block0 32 15 26 0Make a list of all virtual addresses (In decimal) that will cause a page fault if used by the CPU.
Consider a computer with byte-addressable main memory of size 8 GB and page size of 1 KB. Assume a process P has a virtual address space from 0 to 3653 (decimal). Determine the width of the virtual address , the width of the page # field and the width of the offset field (Note: enter only the numbers e.g. 8 for 8 bits etc.)
9. Consider a system that uses 32-bit addresses and page table structures as discussed in class. If the address space of a process contains exactly 256 pages, what is the minimum number of pages that might be needed for its page table structure? What is the maximum number that might be needed? Briefly explain your answer.