Suppose we have already the page table shown below, what happens when CPU generates address 3000? Does it generate a page fault? Valid Addresses Frame Bit 0 - 1023 Page 0 : 1: 1024 - 2047 2: 2048 - 3071 3 : 3072 - 4095 4: 4096 - 5119 5 : 5120 - 6143 6 : 6144 - 7167 7: 7168 - 8191 Page 0 1 1 1 3 Page 2 Table 3 4 1 1 2

Suppose we have already the page table shown below, what happens when CPU generates address 3000? Does it generate a page fault? Valid Addresses Frame Bit 0 - 1023 Page 0 : 1: 1024 - 2047 2: 2048 - 3071 3 : 3072 - 4095 4: 4096 - 5119 5 : 5120 - 6143 6 : 6144 - 7167 7: 7168 - 8191 Page 0 1 1 1 3 Page 2 Table 3 4 1 1 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

I have a 128-bit computer where addresses are 128 bits wide. I want to implement virtual memory with paging for this computer, and I want to use a page size of 4KB. I will design it so that a page table consumes exactly one page. How many page table entries (PTEs) fit within a page?
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
On a simple paging system with 224 bytes of physical memory, 256 pages of logical address space, and a page size of 210 bytes. 1. How many bits are needed to store an entry in the page table (how wide is the page table)? Assume a valid/invalid 1-bit is included in each entry. 2. If the page table is stored in the main memory with 250nsec access time, how long does a paged memory reference take? 3. If the page table is implemented using associative registers that takes 95nsec. and main memory that takes 200nsec, what is the total access time if 75% of all memory references find their entries in the associative registers?
Fill in blank Suppose that linear page table is used where the memory addresses are 12-bit binary numbers and the page size is 256 bytes. If a virtual address in binary format is 101000011100, then the VPN (virtual page number) in binary format will be ---------
For a microprocessor the code segment starts at 20000H, and stack segment starts at 21000H.Physical addresses from 21000H to 2FFFFH are accessible from both code and stack segment.These are the physical addresses.● If a location has CS: IP=2000H: 3000H, can we access this location with SS: SP? If yes,what is the SS: SP for this location? If no, why is it not accessible?● If another location has CS: IP=2000H: 0030H, can we access this location with SS: SP? Ifyes, what is the SS: SP for this location? If no, why is it not accessible?
Suppose we have a byte-addressable computer using direct mapping with 16-bit main memory addresses and 32 blocks of cache. If each block contains 16 bytes. a. Determine the number of bits of the offset field. b. Determine the number of bits of the block (or slot) field. c. Determine the number of bits of the tag field. d. To which cache block would the hexadecimal address 0x2468 map? e. What is the tag of the hexadecimal address 0x2468 f.To which cache block would the hexadecimal address 0x864A map? g. What is the tag of the hexadecimal address 0x864A?
Suppose we have a byte-addressable computer using direct mapping with 16-bit main memory addresses and 32 blocks of cache. If each block contains 8 bytes. a. Determine the number of bits of the tag field. b. To which cache block would the hexadecimal address 0x2468 map? c. What is the tag of the hexadecimal address 0x2468
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. 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) B. 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 fault" with the proper explanation) C. What physical address corresponds to the virtual address 0x84? Answer should be in hexadecimal number. (if the address causes a page fault, answer as "page fault" with the proper explanation)
A computer with 32 bits virtual address uses a two-level page table. Virtual addresses are split into a 10 bits top-level page table field (PT1), a 10 bits second-level page table field (PT2), and an offset. How many PT1, PT2, and offset with virtual address 0x00403008? A. PT1=1; PT2=1; offset=8B. PT1=1; PT2=3; offset=8C. PT1=4; PT2=3; offset=8D. PT1=4; PT2=1; offset=8
Using the following page replacement algorithms, determine the number of faults in the following reference string given a physical memory size of 4 frames: 5 6 5 4 4 4 8 2 9 9 0 4 5 3 9 6 8 1 9 1 6 1 0 0 5 Replacement algorithm 3 frames FIFO OPT LRU LFU MFU
hey teacher. can you solve? If only one page has a Page table and Page size= 1 KB and page table entry (PTE) = 4 bytes, how many steps of the page table should be used to map the 350 byte address?
Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4,999. The drive is currently serving a request at cylinder 2,150, and the previous request was at cylinder 1,805. The queue of pending requests, in FIFO order, is:2,069 1,2122,2962,8005441,6183561,5234,9653681a. FCFSb. SSTFc. SCANd. LOOKe. C-SCANf. C-LOOK