Question
In: Computer Science
Consider the following page reference string:5, 1, 5, 5, 3, 6, 2, 3, 0 , 7,...
Consider the following page reference string:5, 1, 5, 5, 3, 6, 2, 3, 0 , 7, 2, 5, 2, 1, 7, 2, 3, 1, 4, 6.Assuming demand paging with three frames, how many page faults would occur for the following replacement algorithms?• LRU replacement• FIFO replacement• Optimal replacement
Solutions
Expert Solution
In LRU the page that has not been referenced for the longest time gets evicted.
The hits are colored in green, so total of 6 hits and 14 faults.
In FIFO replacement the page that has been for the longest time(which has arrived the first among the pages present in cache currently) in the cache gets evicted
number of hits =7 , faults=13
In OPT replacement policy ,among the pages currently in cache the page that will not be used for the longest time gets evicted.
the number of hits are 10 and faults=10
venereology answered 3 months agoRelated Solutions
Consider the following page reference string: 0, 1, 2, 3, 1, 0, 4, 5, 1, 0,...
Consider the following page reference string: 0, 1, 2, 3, 1, 0,
4, 5, 1, 0, 1, 2, 6, 5, 2, 1, 0, 1, 2, 5 How many page faults would
occur for the following replacement algorithms, assuming one,
three, five, and seven frames? Remember that all frames are
initially empty, so your first unique pages will cost one fault
each. Optimal replacement LRU replacement CLOCK replacement FIFO
replacement
Consider the following page reference string: 0, 1, 2, 3, 1, 0, 4, 5, 1, 0,...
Consider the following page reference string:
0, 1, 2, 3, 1, 0, 4, 5, 1, 0, 1, 2, 6, 5, 2, 1, 0, 1, 2, 5
How many page faults would occur for the following replacement
algorithms, assuming one, three,
five, and seven frames? Remember
that all frames are initially empty, so your first unique pages
will cost one fault each.
Optimal replacement
LRU replacement
CLOCK replacement
FIFO replacement
Consider the following reference string: 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0,...
Consider the following reference string:
7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1
Find the number of Page Faults with FIFO, Optimal Page
Replacement, and LRU with four free frames that are initially
empty. Which algorithm gives the minimum number of page faults?
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
Print a copy of this page. For each of the 4 combinations,
below, move from left to right as...
The following page-reference string: 1, 2, 4, 3, 2, 5, 4, 2, 4, 2, 1, 3,...
The following page-reference string:
1, 2, 4, 3, 2, 5, 4, 2, 4, 2, 1, 3, 2, 3, 1, 3, 6, 1, 6,
4.
Main memory with 3 frames of 1 kilobyte available and
they are all initially empty. Complete a figure, similar to Figure
8.14(in the slides or textbook), showing the frame allocation for
each of the following page replacement policies:
a. Optimal
b. Least recently used
c. First-in-first-out
Then, find the relative performance of each policy with
respect...
Find LRU paging A program has the following page reference string 0 1 2 3 3...
Find LRU paging
A program has the following page reference string 0 1 2 3 3 4 2
4 5 3 3 4 6 2 5 6 If we allocate 3 page frames to the program, 1.
Please draw a figure to show the page allocation/replacement. 2.
How many page faults will be generated?
Page Replacement Algorithms. Consider the following page reference stream and 3 page frames: 0 1 2...
Page Replacement Algorithms. Consider the
following page reference stream and 3 page frames: 0 1 2 3 2 4 3 1
1 5 2 4 6 3 3 4 6 3 4 7.
For the MIN, FIFO, and LRU algorithms, show the contents of the
page frame after each reference, and then compute the total number
of page faults, divided in to cold misses and other misses.
Consider the following string of page references: 5, 7, 8,9, 7, 3, 7, 4, 9, 3,...
Consider the following string of page references:
5, 7,
8,9, 7, 3, 7, 4, 9, 3, 7, 3, 9.
showing the frame allocation for:
a.
Optimal
b. LRU
(least recently used)
c.
FIFO (first-in-first-out)
d.
List the total number of page faults for each policy. Count page
faults only after all frames
have
been initialized.
Consider the following data: 5, 0, 1, 3, 6, 3, 7, 11. Find the standard deviation....
Consider the following data: 5, 0, 1, 3, 6, 3, 7, 11.
Find the standard deviation.
d) Find the median if 10.9 is added to each data
point.
e) Find the mean if 10.9 is added to each data
point.
f) Find the standard deviation if 10.9 is added to
each data point.
g) Find the median if each data point is
multiplied by 9.4.
h) Find the mean if each data point is multiplied
by 9.4.
i) Find standard...
6 5 4 5 0 0 13 48 6 1 0 7 2 0 1 1...
6
5
4
5
0
0
13
48
6
1
0
7
2
0
1
1
0
2
11
5
11
27
4
0
6
Create Standard Deviation Chart (Normal Distribution
Curve)
ADVERTISEMENT
ADVERTISEMENT
Latest Questions
- Problem 1: In the figure to the right, m1=20.0kg and α=53.1o . The coefficient of kinetic...
- A palindrome is a string whose reversal is identical to the string. For example, 110010011 is...
- Explain how the shape of the load duration curve for a particular system affects the selection...
- For physics discussion post. Please TYPE the response as I struggle with reading written information. Explain...
- Consider a file system using a multi-level indexing scheme in inodes as the file organization. In...
- 1a) A sample of a new cleaning product, "Joe's Famous Bleach Cleaner," with a mass of...
- TRANSPARANT DATA ENCRYPTION TOPIC INTRODUCTION 150WORDS, DESCRIPTION 250 WORDS, CONCLUTION 150 WORDS USE OWN WORDS 500 WORDS....
ADVERTISEMENT