3. Consider the following sequence of virtual page references: 4,4,7,6,7,0, 5, 1, 7,5, 0, 4, 2, 0, 5, 1, 4, 3, 6, 1 List the total number of page faults for each replacement policy. Starting with an empty main memory, count page faults only after all physical pages have been initialized. a. first-in, first-out (FIFO) b. least recently used (LRU)

3. Consider the following sequence of virtual page references: 4,4,7,6,7,0, 5, 1, 7,5, 0, 4, 2, 0, 5, 1, 4, 3, 6, 1 List the total number of page faults for each replacement policy. Starting with an empty main memory, count page faults only after all physical pages have been initialized. a. first-in, first-out (FIFO) b. least recently used (LRU)

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter20: Queuing Theory

Section20.10: Exponential Queues In Series And Open Queuing Networks

Problem 12P

See similar textbooks

Similar questions

question 3 : With the same physical memory and the same initial page assignments as in question 1, how many page faults will occur If Optimal page replacement is used ? Assume the reference string (RS) is the same 0172327103? Time t 0 1 2 3 4 5 6 7 8 9 10 RS 0 1 7 2 3 2 7 1 0 3 Frame 0 0 Frame 1 1 Frame 2 2 Frame 3 3 please find the below question 1 for reference as stated in question 3 above and please answer question 3 accordingly: question 1 : The physical memory consists of 4 frames: 0 through 3. Initially, the frames contain the pages 0 through 3 (as shown at time 0). If FIFO page replacement is used, how many page faults will occur with the reference string (RS) 0172327103?
A computer uses virtual memory, and a new solid-state drive (SSD) as space for paging. Refer to the last ppt file. In the case presented there, the hard disk drive (HDD) required 25 ms to read in a page, and a rate of 1 page fault per 1000 references introduced a 250 slowdown. If the SSD offers a time of only 80 µs, what is the slowdown in performance caused by 1 pf per 1000 references (you are not concerned with dirty vs. clean pages). What is the maximum rate of page faults you can accept if you want no more than a 5% slowdown in execution using virtual memory? Know your metric prefixes and symbols for time: s for seconds, ms for milliseconds, µs for microseconds, ns for nanoseconds.
Consider the following page address stream: 2 1 4 3 5 3 2 4 5 2 1 2 4 3 1 Which of the following causes the most page faults to occur on a machine with 3 frames? Scheme that causes the most faults: a) First in First out b) LRU and FIFO are the same number of faults c) FIFO and Opitimal are the same number of faults d) All have the same number of faults e) Least Recently Used f) No faults occurs g) LRU and Optimal are the same number of faults h) Optimal NUMBER OF FAULTS CAUSED: a)
A process contains 8 virtual pages on the disk, and is assigned a fixed allocation of 4 page frames in the main memory . The following page trace occurs: 1, 0, 2, 2, 1, 7, 6, 7, 0, 1, 2, 0, 3, 0, 4, 5, 1, 5, 2, 4, 5, 6, 7, 6, 7, 2, 4, 2, 7, 3, 3, 2, 3 1.Show the successive pages residing in the four frames using the LRU replacement policy. Compute the hit ratio in main memory. Assume that the frames are initially empty. 2.Repeat part (a) for the FIFO replacement policy. 3Compare the two hit ratios and comment on the effectiveness of using FIFO to approximate LRU with respect to this particular trace.
NO PLAGARISM Assume that a main memory with only 4 frames each of 16 bytes is initially empty. The CPU generates the following sequence of virtual addresses and uses the Optimal Page replacement policy. 0,4,8,20,24,36,44,12,68,72,80,84,28,32,88,92 Your task is to find out the followings: a. How many page faults does this sequence cause? b. What are the page numbers of the pages which are present in the main memory at the end of the sequence? Assume that it is a byte addressable system.
Consider a main memory with five page frames and the following sequence of page references: 3, 8, 2, 3, 9, 1, 6, 3, 8, 9, 3, 6, 2, 1, 3 What is the total number of page faults that occur when least recently used (LRU) page replacement policies are used? Describe with page frames
Consider the following page reference string: 7, 2, 3, 1, 2, 5, 3, 4, 6, 7, 7, 1, 0, 5, 4, 6, 2, 3, 0, 1. Assuming pure demand paging with three frames (3 pages can be in memory at a time). a)Using FIFO replacement algorithm, show the content of the memory (which pages are in memory) for each page reference. b) How many page faults resulted from this algorithm? c) Repeat a) and b)above with LRU algorithm.
Given that main memory is composed of two page frames for public use and that aseven-page program (with pages A,B, C, D) requests pages in the following order:A, B, A, C, A, B, D, B, A, C, Da. Using the FIFO page removal algorithm, do a page trace analysis indicating pagefaults with asterisks (*). Then compute the failure rate. b. Using the LRU page removal algorithm, do a page trace analysis indicating pagefaults with asterisks (*). Then compute the failure rate.
What are structural hazards? Why do they never occur in a single-cycle implementation? what is a page table size for a virtual memory with a 64-bit virtual address, 32kB page size and 8 bytes per entry? Give an example of when your program will experience low spatial locality (what data structure?), and an example of when your program will experience low temporal locality.
Given an O/S which has divided all of main memory into 3 frames; if this O/S uses the LRU algorithm for page replacement/swapping, then how many page faults are generated if the following sequence of pages being accessed by the running process (show your work): 7 0 1 2 0 3 0 4 2 3 0 3 2
Consider the following page reference string for a 12-page executable. 0,1,1,3,4,10,5,2,2,10,6,6,10,11,7,8,7,9,9,6,5,11,9,11How many page faults would occur for the following replacement algorithms, assuming one, two, and four frames?Remember that all frames are initially empty, so your first unique pages will cost one fault each.a. LRU replacementb. FIFO replacementc. Optimal replacement
An operating system uses a Least Recently Used, optimal and also FIFO page replacement algorithm. Consider the following page reference ordering (pages are referenced from left to right): 1, 9, 1, 6, 9, 2, 6, 2, 1, 9, 0. Compute the hit ratio, miss ratio and number of page faults that are generated for all the three algorithms assuming that the process has been allocated four page frames, and that initially, none of the pages are in the main memory.