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

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

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter11: Operating Systems

Section: Chapter Questions

Problem 21VE

See similar textbooks

Similar questions

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
Suppose you have a byte-addressable virtual address memory system with 32 virtual pages of 32 bytes each, and 8 page frames. Assuming the following page table, answer the questions below: | Page # | Frame # | Valid bit ||--------|---------|-----------|| 0 | 4 | 1 || 1 | 3 | 1 || 2 | - | 0 || 3 | 0 | 0 || 4 | 1 | 1 || 11 | 6 | 0 || 13 | 7 | 1 || 17 | - | 0 | a) How many bits are needed to address this virtual memory? b) What is the size of the Page field? c) What is the size of the Offset field? d) What is the size of the Page Frame field? e) What is the maximum number of the entries in this Page Table? f) What Physical address corresponds to the Virtual address 0x22? Answer should be in hexadecimal number. (if the address causes a page fault, answer as "page fault" with the proper reason) g) What Physical address corresponds to the…
Suppose you have a byte-addressable virtual address memory system with 32 virtual pages of 32 bytes each, and 8 page frames. Assuming the following page table, answer the questions below: | Page # | Frame # | Valid bit ||--------|---------|-----------|| 0 | 4 | 1 || 1 | 3 | 1 || 2 | - | 0 || 3 | 0 | 0 || 4 | 1 | 1 || 11 | 6 | 0 || 13 | 7 | 1 || 17 | - | 0 |a) How many bits are needed to address this virtual memory? b) What is the size of the Page field? c) What is the size of the Offset field? d) What is the size of the Page Frame field?
A system with simple paged memory management has addresses of B bits and pages of size P KiB. If all memory is pageable, what is the maximum number of items contained in a process's page table? What if K KiB are reserved for the kernel and are not pageable? Also suppose that the page table is organized in 2 levels, so that the page directory (first level) is addressed by D bits. How many bits will be used to address the second level? How many entries will there be, at most, among all the tables of the pages (first and second level) of a process?
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. 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 c) Now, translate the virtual addresses shown in question I(e) to physical addresses for the two-level page table. Show how you obtain your answers. 0x0389 0xDF78 0x0245 0x8012
Consider an operating system using memory mapping on a page basis and using a single level page table. Assume that the necessary page table is always in memory. The system takes 200 ns to make a memory reference, how long does a paged memory reference take? Group of answer choices 400 ns (nanoseconds) 809.2 ms (microseconds) 200 ns (nanoseconds) 1638.4 ms (microseconds)
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?
Suppose you have a byte-addressable virtual address memory system with 16 virtual pages of 64 bytes each and 4-page frames. Assuming the following page table, answer the questions below: Page # Frame # Valid bit 0 2 1 1 3 1 2 - 0 3 0 0 4 1 1 5 - 0 6 - 0 7 - 0 a) Show the virtual address format, including the name and size of the fields. b) Show the physical address format, including the name and size of the fields. c) What physical address corresponds to the virtual address 0x00? Answer should be in hexadecimal number. (if the address causes a page fault, answer as "page fault" with the proper explanation) d) What physical address corresponds to the virtual address 0x42? Answer should be in hexadecimal number. (if the address causes a page fault, answer as "page fault" with the proper explanation) e) What physical address corresponds to the virtual address 0x72? Answer should be in hexadecimal number. (if the address causes a page fault, answer as "page…
Consider a processor that uses a 48-bit virtual memory address. The main memory installed onthe system is 4GB. Page size is set to be 32KB. Determine the following:I. Address space of virtual memory and physical memory. II. Total Number of virtual pages and the total physical pagesIII. How many bits are necessary to store (i) Page Table entry and (ii) TLB entry, consideringthe TLB entry stores valid, reference and dirty bits.IV. What is the size of the page table? And how many pages of memory is needed to storethe entire Page table? What fraction of physical memory is needed to store the entirepage table?
Consider a system with 256Mbytes of main memory with page size of 4Kbytes. It has a logical address space of 26-bits. Answer the following questions. (Assume byte-addressable memory) (i) How many of the 26-bits of the logical address represent page# and how many bits represent the offset? (ii) How many entries are there in a conventional single-level page table for a process? (iii) How many entries are there in an inverted page table?
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? With this system, what’s the maximum number of pages that a process can have? 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? 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.
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…