Consider a paged virtual memory system in which a process is allocated with 3 frames. Assume the memory reference string: 1,2,3,4,1,2,5,1,2,3,4,5;Using LRU page-replacement algorithm, How many total page faults are caused.O 10129O 11 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 memory4122344477898Assume 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,5Using LRU page-replacement algorithm, What frame is accessed by Page 5.477O 344122O 898

Algorithms for replacing pages in virtual memory are critical components of virtual memory…

Consider a paged virtual memory system in which a process is allocated with 3 frames. Assume the memory reference string: 1,2,3,4,1,2,5,1,2,3,4,5; Using LRU page-replacement algorithm, How many total page faults are caused. O 10 12 O 9 O 1

Consider a paged virtual memory system in which a process is allocated with 3 frames. Assume the memory reference string: 1,2,3,4,1,2,5,1,2,3,4,5; Using LRU page-replacement algorithm, How many total page faults are caused. O 10 12 O 9 O 1

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Similar questions

Calculate the total page faults using the CLOCK algorithm and a window size = 3 frames Given the following reference string : 1 2 1 3 45 3245 6 4 3 2 Fill in chart. Include the use bit (required for last set of frames only) There is no internal fragmentation. Total page faults CLOCK algorithm The process running has at least The size of a frame is 256 bytes. The program has at least pages in the program. bytes 3 4 5265
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…
Computer Science 9. In a paging system , the logical address is formed of 20 bits. the most significant 8 bits denote the page number, the least significant 12 bits denote the offset. Memory size is 256K bits. a. What is the page size (in bits)? b. What is the maximum number of pages per process? c. How many frames does this system have? d . Give the structure of the page table of a process executing in this system. Assume 2 bits are reserved for attributes. e. How many bits are required for each page table entry? f. If physical memory is upgraded to 1024 K bits, how will your answer to c and e change?
Given a computer using a byte-addressable virtual memory system with a two-entry TLB, a 2-way set associative cache, and a page table for a process P. Assume cache blocks of size 8 bytes. Assume pages of size 16 bytes and a main memory of 4 frames. Assume the following TLB and page table for Process P: TLB 0 Vali d 0 1 1 1 2 0 3 1 4 1 5 0 6 0 7 0 Assume process P generates a memory request with virtual address Ox12. What is its corresponding physical address? You may represent the address in binary or hexadecimal notation. 3 3 0 2 1 4 Page Table f 1
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)
If an operating system uses the FIFO page replacement algorithm and the main memory has only 3 frames, the number of page faults that will occur for the following sequence of page references is 4, 2, 5, 3, 2, 5, 4, 1, 3, 2, 4 Select one:
Suppose you have system with 8 virtual pages of 64 bytes each, and 4 page frames. Assuming the following page table, answer the questions below: a) How many bits are in a virtual address? b) How many bits are in a physical address? c) What physical address corresponds to the following virtual addresses (if the address causes a page fault, simply indicate this is the case)? a byte-addressable virtual address memory Frame # Valid Bit i) 0×0B ii) ОхВА iii) 0×1C iv) 0×3A v) 0x34 Page # 3 1 1 1 1 2 4 1 5 7 2
Given a computer using a byte-addressable virtual memory system with a two-entry TLB, a 2-way set associative cache, and a page table for a process P. Assume cache blocks of size 8 bytes. Assume pages of size 16 bytes and a main memory of 4 frames. Assume the following TLB and page table for Process P: TLB Page Table Valid f 3. 1. 1 2. 2. 1 4 0. 6. 0. 7. How many bits are in a virtual address for process P? Click Save amd Submit to save and submit. Click Save All Answers to save all answers. 56° hp
1. Consider a computer system with a 30-bit logical address and 4-KB page size. The systemsupports 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.c. A conventional single-level page table?d. An inverted page table?e. A two-level hierarchical page table? 2. Consider a virtual memory system with a 50-bit logical address and a 38-bit physical address.Suppose that the page/frame size is 16K bytes. Assume that each page table entry is 4 Bytes.a. How many frames are in the systems? How many pages in the virtual address space for aprocess?b. If a single-level page table is deployed, calculate the size of the page table for each process.c. Design a multilevel page table structure for this system to ensure that each page table can fitinto one frame. How many levels do you need? Draw a figure to show your page systems
Consider an 8-bit memory architecture that uses a single level page table with 4-bit page numbers and implements demand paging and copy-on-write. Consider the following page table where the pages are numbered from the bottom up. I.e., the bottom entry corresponds to page 0. Valid Access Frame 1 RW Ox3 RW Ox0 1 RW Ox1 RW RW RW RW RW RW RW 1 RW Ox7 1 RW Ox8 RW Ox2 RX Ox4 RX Ox9 RX Ox4 In the worst case, how many pages will need to be copied as a result of this process' execution? O All of them
2. Assume we have 1 GB of physical memory. Inverted page table is used. Page size is 16 KB. Each entry in the inverted table is 16 bytes. What is the RAM space needed for storing the inverted table?
Consider the following page address stream: 2 4 2 4 1 2 5 1 3 3 1 Using the Least Recently Used algorithm on a machine with 4 frames, which page address will cause the first fault? a) 1 b) No fault occurs c) 2 d) 3 e) 5 f) 4