1. Consider a system where 3 page frames are allocated to a process. Consider the following...
1. Consider a system where 3 page frames are allocated to a process. Consider the following sequence of memory references: 3 2 1 0 3 2 4 3 2 1 0 4. Assuming no pages are initially in memory, how many page faults are there assuming a FIFO page replacement algorithm is used?
2. Repeat problem 1 with number of frames increased to 4.
3. Compare the number of page faults from 1 and 2. Is there Belady’s anomaly?
4. Repeat problems 1 and 2 using optimal page replacement algorithm.
5. What is the difference between local and global page replacement?
Homework Answers
Add Answer to:
1. Consider a system where 3 page frames are allocated to a
process. Consider the following...
Consider the following sequence of page references 8, 5, 1, 8, 2, 5, 1, 4, 2, 3, 5, 3, 2, 8, 4. Assume that the memory h...
Consider the following sequence of page references 8, 5, 1, 8, 2, 5, 1, 4, 2, 3, 5, 3, 2, 8, 4. Assume that the memory has 3 frames which initially are free. What is the number of page faults using each of the following algorithms? a. FIFO b. LRU c. Clock d. Optimal
Consider the following sequence of page references 8, 5, 1, 8, 2, 5, 1, 4, 2,...
Consider the following sequence of page references 8, 5, 1, 8, 2, 5, 1, 4, 2, 3, 5, 3, 2, 8, 4. Assume that the memory has 3 frames which initially are free. What is the number of page faults using each of the following algorithms? a. FIFO b. LRU c. Clock d. Optimal
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...
Consider the following page reference using four physical frames that are initially empty. (a) (5 points)...
Consider the following page reference using four physical frames that are initially empty. (a) (5 points) Find the page faults using LRU algorithm, where the page reference sequence: 5,2,5,1,4,5,2,0,4,2,3,1,2,1,0,0,2,4,5,1? (b) (5 points) Find the page faults using FIFO algorithm, where the page reference sequence: 5,2,1,5,1,0,3,1,2,1,4,0,5,4, 2,3,3, 4,2,1? (c) (5 points) Find the page faults using LRU algorithm, where the page reference sequence: 5, 0, 4, 4, 0, 3, 0, 4, 1, 0, 2, 0, 5, 3, 0, 1?
Assuming that there are three frames available in main memory, for the following string of page...
Assuming that there are three frames available in main memory, for the following string of page references, determine how many page faults would be generated using the Optimal Page Replacement Algorithm. 1,2,4,3,1,3,5,1,2,4,5,3
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
<Operating System> 1. A process accesses pages in the following order (Assume all frames are initially...
<Operating System> 1. A process accesses pages in the following order (Assume all frames are initially empty): 1 2 3 4 2 1 5 6 2 1 2 3 7 6 3 2 1 2 3 6 Determine the number of page faults that will occur for the following algorithms: (Show your work!) Least Recently Used replacement algorithm with 5 frames available to the process. What is the minimum number of page faults that can occur for this process, regardless...
III. Consider a process that has been allocated 5 pages of memory: P1, P2, P3, P4, and P5. The process accesses these pages in the following order: P1 P2 P3 P4 P1 P2 P5 P1 P2 P3 P4 P5 (i) Illustrate...
III. Consider a process that has been allocated 5 pages of memory: P1, P2, P3, P4, and P5. The process accesses these pages in the following order: P1 P2 P3 P4 P1 P2 P5 P1 P2 P3 P4 P5 (i) Illustrate Belady’s anomaly by precisely describing the execution of the FIFO page eviction algorithm in two cases: a) where the machine has 3 pages of physical memory, and b) where the machine has 4 pages of physical memory, and by...
Show how many page faults are will occur if a process access the following page sequence...
Show how many page faults are will occur if a process access the
following page sequence (reference string). Assume OS is using a
fixed number of 4 pages allocated for the process and is using
First-In-First-Out (FIFO) algorithm.
Count the faults acquired in the page table initialization.
Show your work by completing the following table:
Show how many page faults are will occur if a process access the following page sequence (reference string). Assume OS is using a fixed number...
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...
Show how many page faults are will occur if a process access the
following page sequence (reference string). Assume OS is using a
fixed number of 4 pages allocated for the process and is using
First-In-First-Out (FIFO) algorithm.
Count the faults acquired in the page table initialization.
Show your work by completing the following table:
Show how many page faults are will occur if a process access the following page sequence (reference string). Assume OS is using a fixed number...
Most questions answered within 3 hours.
-
Where is the error in this code sequence?
String s1 = "Hello";
String s2 = "ello";...
asked 10 months ago -
Financial data for Joel de Paris, Inc., for last year
follow:
Joel de Paris, Inc.
Balance...
asked 10 months ago -
Consider this reaction:
Al2(SO4)3 (aq)+ BaCl3
(aq) Al2Cl6 (aq)- +
3BaSO4(s) . What is the...
asked 10 months ago -
Suppose that Savneet is considering increasing her
recent random sample from 20 car rentals to 40...
asked 10 months ago -
Trucks arrive at an unloading terminal at an average rate of 120
per hour.
Trucks arrive...
asked 10 months ago -
Why are methanol and ethanol completely soluble in water while
octanol is not very little soluble....
asked 10 months ago -
A facilities manager at a university reads in a research report
that the mean amount of...
asked 10 months ago -
When the CuSO4 is rehydrated by adding water to the anhydrous
compound, is this an endothermic...
asked 10 months ago -
A ray of sunlight is passing from diamond into crown glass; the
angle of incidence is...
asked 10 months ago -
A block of mass 0.249 kg is placed on top of a light, vertical
spring of...
asked 10 months ago -
how do the kidneys compensate in the presences of acidosis
a) trigger hyperventilate
b) reserve acid...
asked 10 months ago -
Question 501 pts
The rental rate of capital to the firm increases. Which of the
following...
asked 10 months ago