Suppose the page table for the process currently executing on the processor looks like the following.All numbers are decimal, everything is numbered starting from zero, and all addresses are memorybyte addresses. The page size is 1,024 bytes.2,221Virtual page number5,49902345Valid bit10101Reference bit0000Modify bit00001Page frame number7I2IWhat physical address, if any, would each of the following virtual addresses correspond to? (Do nottry to handle any page faults, if any.)1,0520

In computer memory management, a physical address refers to the actual location in the physical…

Suppose the page table for the process currently executing on the processor looks like the following. All numbers are decimal, everything is numbered starting from zero, and all addresses are memory byte addresses. The page size is 1,024 bytes. 1,052 Virtual page number 2,221 5,499 0 2 3 5 Valid bit 1 0 0 1 Reference bit 1 1 0 0 0 0 Modify bit 0 0 0 0 1 Page frame number 7 I What physical address, if any, would each of the following virtual addresses correspond to? (Do not try to handle any page faults, if any.) 2

Suppose the page table for the process currently executing on the processor looks like the following. All numbers are decimal, everything is numbered starting from zero, and all addresses are memory byte addresses. The page size is 1,024 bytes. 1,052 Virtual page number 2,221 5,499 0 2 3 5 Valid bit 1 0 0 1 Reference bit 1 1 0 0 0 0 Modify bit 0 0 0 0 1 Page frame number 7 I What physical address, if any, would each of the following virtual addresses correspond to? (Do not try to handle any page faults, if any.) 2

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

Solve...
What is the physical address of the following picture:
The IBM System/370 architecture uses a two-level memory structure and refers to the two levels as segments and pages, although the segmentation approach lacks many of the features described earlier in this chapter. For the basic 370 architecture, the page size may be either 2 Kbytes or 4 Kbytes, and the segment size is fixed at either 64 Kbytes or 1 Mbyte. For the 370/XA and 370/ESA architectures, the page size is 4 Kbytes and the segment size is 1 Mbyte. Which advantages of segmentation does this scheme lack? What is the benefit of segmentation for the 370?
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?
Giventhe following assignment of some program’s virtual pages to physical pages in a system with 4 KiB byte pages, what physical memory address corresponds to virtual address 20000? (All values are given in decimal.)
A user program before being executed goes through several steps. Binding of symbolic addresses to relocatable addresses happens along the way. Discuss the different ways in which these binding/ mapping of instructions and data to memory addresses can happen.
Assume a logical address space consists of 4 pages of 4096 words each and is mapped to a physical memory space of 256 frames. What is the size of the physical address space? 12 bits 14 bits 20 bits 8 bits
Suppose a computer system uses 16 but addresses for both virtual and physical address. In addition, assume each page (and frame) has a size of 256 bytes. -How many bits are used for page number? -How many bits for offset? -what is the max number of pages a process can have?
Draw the complete block diagram for an 8086 Microprocessor system with two PPIS, where the address (PA/PPI1)-82H and the address (PA/PPI2)=83H. Then, write a program to read 64 bytes from the PA&PB of PPII and display them on PPI2-ports in the right sequence using mode 1.
Consider a paged virtual memory system in which a process is allocated with 4 frames. The contents of the page map table are given below with two frames being empty. PageActual frame address in memory 4 122 344 477 898 Assume that the order in which the pages appear is the order in which the pages were added to the table (i.e., Page 2 was accessed after Page 4) Assume that the subsequent page accessing is : 1,2,3,4,1,2,5 Using LRU page-replacement algorithm, What frame is accessed by Page 5. 477 O 344 122 O 898