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

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter11: Operating Systems

Section: Chapter Questions

Problem 26VE

See similar textbooks

Similar questions

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 1024 bytes. Virtual page number 0 1 2 3 4 5 Valid bit 1 1 0 1 0 1 (ii) 2221 (iii) 5499 Reference bit 1 1 0 0 0 0 Modify bit 0 1 0 0 0 1 Page frame number 4 7 - 2 0 a. Describe exactly how, in general, a virtual address generated by the CPU is trans- lated into a physical main memory address. b. What physical address, if any, would each of the following virtual addresses corre- spond to? (Do not try to handle any page faults, if any.) (i) 1052
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. Virtual page number 0 Valid bit Reference bit Modify bit Page frame number 1 1 0 1 1 7 2 0 0 0 3 1 0 0 2 4 0 0 0 5 1 0 1 0 What physical address, if any, would each of the following virtual addresses correspond to? (Do not try to handle any page faults, if any.) 1,052 2,221 5,499 Edit View Insert 12pt Paragraph Format Tools Table BIU Av
Assuming a 4-KB page size (4096 bytes), what are the page numbers and offsets for the following address references (provided as decimal numbers); assume that the memory is byte addressable. a. 3000 b. 40000 c. 200000 d. 6000000
In a main memory-disk virtual storage system, the page size is 1KByte and the FIFO algorithm is used for page replacements. A given program has been allocated three page frames in the main memory and it makes the following 16 memory references when it starts executing (the addresses are given in decimal):500, 2000, 2500, 800, 4000, 1000, 5500, 1500, 2800, 400, 5000, 700, 2100, 3500, 900, 2400 Fill in the contents of the three page frames after each memory reference in a table and calculate the hit ratio. Hint: denote by 'a' the page consisting of locations 0 through 1023 in memory. Similarly, b: 1024-2047, c: 2048-3071, d: 3072-4095, e: 4096-5119 and f: 5120-6143. Round to three decimal places.
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…
Question 8: A CPU generates 32-bit virtual addresses. The page size is 4 KB. The processor has a translation look-aside buffer (TLB) which can hold a total of 128 page table entries and is 4-way set associative. The minimum size of the TLB tag is: 01 02 0 3 04 1. 11 bits 2. 13 bits 3. 15 bits 4. 20 bits
Suppose a computer system uses 16-bit addresses for both its virtual and physical addresses. In addition, assume each page (and frame) has size 256 bytes. How many bits are used for the page number? How many bits are used for the offset? 8 bits each. With this system, what’s the maximum number of pages that a process can have? 256 Suppose that each entry in the page table comprises 4 bytes (including the frame number, the valid bit, and miscellaneous “bookkeeping bits”). An OS uses an array to store the page table. What is the size of the page table? 1024 Bytes Furthermore, suppose the first 6 pages of a process map to frames 222 to 227 (as decimal numbers), and the last 5 pages of the process map to frames 1 to 5 (also decimal numbers). All other pages are invalid. Draw the page table, including the valid bit and the frame number. DONE Translate the following virtual addresses to physical addresses, and show how you obtain the answers. (Hint: You do not need to convert…
Suppose a computer system uses 16-bit addresses for both its virtual and physical addresses. In addition, assume each page (and frame) has size 256 bytes. Could you hand draw the page table, if possible a) Suppose that the OS uses a two-level page table. Draw the page table. (Assume that frames 7 through 221 are free, so you can allocate space for the page table there.) In addition, suppose that the page-table directory storage comprises a whole number of consecutive full frames. (For examples: if the directory entry is 2 bytes, the entry’s storage comprises 1 frame; if the directory entry is 260 bytes, the entry’s storage comprises 2 consecutive frames.) b) What is the size of the two-level page table
A computer with a 32-bit address uses a two-level page table. Virtual addresses are split into a 9-bit top-level page table field, an 11-bit second-level page table field, and an offset. How large are the pages and how many are there in the address space?
Consider a memory implemented for 8086 microprocessor Draw the memory block diagram. Determine the values for A0 , /BHE ,address lines(A1..A19) and data lines(D0.. D15) in order to access: A byte at odd address [01FF3H] A byte at even address [01FFCH] A word at even address [01FFEH] A word at odd address [01ABFH]
Suppose a virtual memory address is 0x123456789012. Divide this address into the 4 different page table parts and the within page offset.
An address space in the memory map starts at address Ox40000000 and ends at address O×40000FFE. What is the size of the space if the data size is 2 bytes? 16k bytes 4k bytes 2k bytes 8k bytes