A given process has a page table as shown below. Assume that the page size is 2048 and that all the pages are in main memory. What do the numbers 3, 2, 6, 7, and 11 represent? Be specific. To which logical address will the physical address 7356 correspond? To which physical address will the logical address (3,420) correspond? On the average, what will be the internal fragmentation associated with a process for the paging system? Page Table Page 0 3 Page 1 2 Page 2 6 Page 3 7 Page 4 11

A given process has a page table as shown below. Assume that the page size is 2048 and that all the pages are in main memory. What do the numbers 3, 2, 6, 7, and 11 represent? Be specific. To which logical address will the physical address 7356 correspond? To which physical address will the logical address (3,420) correspond? On the average, what will be the internal fragmentation associated with a process for the paging system? Page Table Page 0 3 Page 1 2 Page 2 6 Page 3 7 Page 4 11

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter12: Secondary Storage Management

Section: Chapter Questions

Problem 6RQ

See similar textbooks

Similar questions

Consider a computer system with a 30-bit logical address and 4-KB page size. The system supports up to 512 MB of physical memory. How many entries are there in each of the following? Assume that each page table entry is 4 Bytes. A conventional single-level page table? An inverted pagetable? A two-level hierarchical page table?
Consider an operating system that uses 48-bit virtual addresses and 16KB pages. The system uses a hierarchical page table design to store all the page table entries of a process, and each page table entry is 4 bytes in size. What is the total number of pages that are required to store the page table entries of a process, across all levels of the hierarchical page table?
Consider a paging memory allocation whose page size is 5KB and one word is equalto 8 Bytes. Answer these three sub-questions. How many words are there in one page? What are the page number and page offset for this logical address: 33124? Consider a process of 41500 Bytes being allocated into the main memory by this pagingmemory allocation. How much is the size of internal fragmentation (in the unit of Bytes)?
A system has 4-kB pages, a 48-bit virtual address space, and a 33-bit physical address space. Assuming that page tables contain only physical page numbers--that is, no meta-data--that it is implemented as a simple lookup table, and that physical page numbers are packed into the smallest number of 8-bit bytes that can hold them (there may be wasted bits at each entry), how many bytes of memory are required to hold the entire page table? Please enter your answer in bytes.
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.
Consider a logical address of 128 pages of 1024 words each, mapped onto a physical memory of 64 frames. i. How many bits are there in the logical address? ii. How many bits are there in the physical address? III. What is the size of the page table?
Glven the below 16-bit Logical Address: 0001000011001101 And the related Process Page Table: Page# Contents 00101 1 00110 01001 3 11001 4 11101 00010 00111 Show the physical address that results from the translation using paging, knowing that the page size is 2K.
The principal advantage is a savings in physical memory space. This occurs for two reasons: (1) a user page table can be paged in to memory only when it is needed. (2) The operating system can allocate user page tables dynamically, creating one only when the process is created. Of course, there is a disadvantage: address translation requires extra work.
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.
Consider an operating system that uses 48-bit virtual addresses and 16KB pages. The system uses a multi-level page table design to store all the page table entries of a process, and each page table entry and index entry are 4 bytes in size. What is the total number of page that are required to store the page table entries of a process, across all levels of the page table? You may follow the hint below or finish from scratch to fill the blanks. Please show your calculations to get partial points like 2^10/2^4=2^6. 1. We need to calculate the total number of page table entries needed for a process (i.e., the total number of pages for a process) 2. We need to calculate how many entries each page can store 3. With 1 and 2, we can calculate how many pages needed for the lowest (innermost) level 4. Each page from 3 requires an entry (pointer) in the upper (next) level. We need to calculate how many pages are required to store this next level entries (please note the entry size is always 4…
Consider a logical address of 128 pages of 1024 words each, mapped onto a physical memory of 64 frames. What is the size of the page table?
Computer Architecture Assume a task is divided into four equal-sized segmrnts and that the system builds an eight-entry page descriptor table for each segment. Thus, the system has a combination of segmentation and paging. Assume also that the page size is 2 Kbytes. a) What is the maximum size of each segment? b) What is the maximum logical address space for the task? c) Assume that an element in physical location 00021ABC is accessed by this task. What is the format of the logical address that the task generates for it?