Consider the following page reference string, for a process with 5 virtual pages, and three frames in memory, and fill in the tables for the LRU.
Homework Answers
When a page reference is not in the frames, we report a page fault with X, unless a frame is empty and the frame is filled with that page reference. When a page fault occurs, the page reference which was used least recently is replaced with the current page reference.
| Page Reference | Frame 1 | Frame 2 | Frame 3 | Page Fault | Reason |
| A | A | X | Since all frames are empty, We fill Frame 1 with A. | ||
| B | A | B | X | Since two frames are empty, We fill Frame 2 with B. | |
| C | A | B | C | X | Since one frame is empty, We fill Frame 3 with C. |
| B | A | B | C | B is present in Frame 2, so no page fault. | |
| D | D | B | C | X | Since A is referenced least recently compared to B and C, it is replaced with D. |
| E | D | B | E | X | Since C is referenced least recently compared to B and D, it is replaced with E. |
| A | D | A | E | X | Since B is referenced least recently compared to D and E, it is replaced with A. |
| B | B | A | E | X | Since D is referenced least recently compared to A and E, it is replaced with B. |
| C | B | A | C | X | Since E is referenced least recently compared to B and A, it is replaced with C. |
| D | B | D | C | X | Since A is referenced least recently compared to B and C, it is replaced with D. |
| A | A | D | C | X | Since B is referenced least recently compared to D and C, it is replaced with A. |
Total page faults is 10.
Add Answer to:
Consider the following page reference string, for a process with
5 virtual pages, and three frames...
Question 7 30 pts Consider the following page reference string: {1,2,3,4,1,5,6,2,1,2,3,7,6,3} Assume that the system has...
Question 7 30 pts Consider the following page reference string: {1,2,3,4,1,5,6,2,1,2,3,7,6,3} Assume that the system has 4 page frames allocated to these 7 pages. Follow the page placement and replacement using the following three replacement algorithms: • LRU replacement • FIFO replacement • Optimal replacement How many page faults will occur for these three algorithms? Assume that all frames are initially empty, so your first unique pages will all cost one fault each USE ENCLOSED TABLES! Show all calculations in...
Consider the following virtual page reference sequence: page 1, 2, 3, 4, 2, 1, 5, 6,...
Consider the following virtual page reference sequence: page 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3. This indicates that these particular pages need to be accessed by the computer in the order shown. Consider each of the following 4 algorithm-frame combinations: LRU with 3 frames FIFO with 3 frames LRU with 4 frames FIFO with 4 frames . For each of the 4 combinations, below, move from left to right as the virtual page numbers are...
Assume demand paging with three frames. Consider the following page reference string: 7, 2, 3, 1,...
Assume demand paging with three frames. Consider the following page reference string: 7, 2, 3, 1, 2, 5, 3, 4, 6, 7, 7, 1 If OPT replacement is used, the number of page faults will be a. 8 b. 9 c. 10 d. 7 e.None of the above If LRU replacement is used, the number of page fault will be a. 8 b. 9 c. 10 d. 11 e. None of the above
Given the following page-reference string, show the allocation of 3 frames of memory using FIFO ,...
Given the following page-reference string, show the allocation of 3 frames of memory using FIFO , LRU and OPT. How many page faults for FIFO, LRU and OPT? 3,1,2,1,3,1,4,1,3,2,4,2,5,6,4,6,2,1,6,5
Consider the following page reference string: 1, 2, 3, 4, 2, 1, 5, 6, 2, 1,...
Consider the following page reference string: 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6. How many page faults would occur for the following replacement algorithms, assuming one, two, three, four, five, six, or seven frames? Remember all frames are initially empty, so your first unique pages will all cost one fault each. • LRU replacement • FIFO replacement • Optimal replacement
Consider the following reference string: How many page faults would this string produce under the FIFO...
Consider the following reference string: How many page faults would this string produce under the FIFO page replacement strategy with three frames? How many page faults would this string produce under the OPT replacement strategy with three frames? How many page faults would this string produce under the LRU replacement strategy with three frames?
Consider the following page reference string: A C B D B A E F B F...
Consider the following page reference string: A C B D B A E F B F A G E F A Assuming demand paging with four frames, how many page faults would occur for the following replacement algorithms? Remember that all frames are initially empty, so your first unique pages will cost one fault each. Show all of your works. LRU replacement FIFO replacement Optimal (MIN) replacement
Operating Systems Virtual Memory Management question Given the reference string of page accesses below, and an...
Operating Systems Virtual Memory Management question Given the reference string of page accesses below, and an allocation of 3 page frames, and the Least-Frequently Used page replacement algorithm. Show the content of the frames as the references are processed, and indicate which references cause page faults. Record the #page faults. ref 1 2 3 5 4 2 5 3 4 5 1 1 3 1 4 frame1 frame2 frame3 fault(X) #faults =
Consider the following page reference string for a three-frame memory: 6 3 1 5 3 4...
Consider the following page reference string for a three-frame memory: 6 3 1 5 3 4 3 2 5 4 3 4 5 1 5 3 1 6 3 1 Apply LRU, Clock and FIFO algorithms What will be the number of page faults for each replacement algorithm note that page faults at the beginning are counted?
Consider the following page reference string for a specific process: 7, 2, 3, 1, 2, 5,...
Consider the following page reference string for a specific process: 7, 2, 3, 1, 2, 5, 3, 4, 6, 7, 7, 1, 0, 5, 4, 6, 2, 3, 0, 1 Assuming demand paging with 3 frames, determine the page fault rate for each of the following page replacement algorithms: a. LRU replacement b. FIFO replacement c. Optimal replacement
Question 7 30 pts Consider the following page reference string: {1,2,3,4,1,5,6,2,1,2,3,7,6,3} Assume that the system has 4 page frames allocated to these 7 pages. Follow the page placement and replacement using the following three replacement algorithms: • LRU replacement • FIFO replacement • Optimal replacement How many page faults will occur for these three algorithms? Assume that all frames are initially empty, so your first unique pages will all cost one fault each USE ENCLOSED TABLES! Show all calculations in...
Consider the following reference string: How many page faults would this string produce under the FIFO page replacement strategy with three frames? How many page faults would this string produce under the OPT replacement strategy with three frames? How many page faults would this string produce under the LRU replacement strategy with three frames?
Most questions answered within 3 hours.
-
Given input { 66, 28, 43, 29, 44, 69, 19 } and a hash function
h(x)...
asked 14 minutes ago -
A pebble with mass m is thrown straight up with an initial speed
v0 so that...
asked 18 minutes ago -
Let X be a discrete random variable that follows a
binomial distribution with n = 11...
asked 26 minutes ago -
The equilibrium constant, K, for the following reaction is
1.29×10-2 at 600
K.
COCl2(g) --->
CO(g)...
asked 39 minutes ago -
It is known that 72% of people have a favorable opinion of their
local police force....
asked 42 minutes ago -
A vertical straight wire carrying an upward 26-A current exerts
an attractive force per unit length...
asked 55 minutes ago -
For the purposes of this assignment, you are to choose an
adaptive trait common to more...
asked 1 hour ago -
Two identical flutes can play middle C (262 Hz) at 20◦C. How
many beats per second...
asked 1 hour ago -
Potassium phosphate and calcium chloride react in a double
replacement reaction. To produce 1.0 moles of...
asked 1 hour ago -
Sparky, Co. purchased land as a factory site for $600,000.
Sparky paid $42,000 to tear down...
asked 1 hour ago -
A Chi-square distribution with 14 degrees of freedom is a
correct model for
Question 8 options:...
asked 1 hour ago -
In a group of 45 mice, there are 10 that have a certain genetic
character. suppose...
asked 1 hour ago