onsider the following page reference string:
3, 8, 2, 9, 8, 2, 3, 9, 2, 8...
onsider the following page reference string:
3, 8, 2, 9, 8, 2, 3, 9, 2, 8
Assuming demand paging with three frames, how many page faults
would occur for the following replacement algorithms? Show your
working. (10-marks)
First in First out
Least Recently Used
Optimal Replacement
Calculate the no. of page faults for each algorithm.
(3-marks)
Which algorithm performs best for the given reference string?
(2-marks)
Consider the following page reference string:
7, 2, 3, 1, 2, 5, 3, 7, 6, 7...
Consider the following page reference string:
7, 2, 3, 1, 2, 5, 3, 7, 6, 7
Assuming demand paging with three frames, how many page faults
would occur for the following replacement algorithms? Show your
working.
First in First out
Least Recently Used
Optimal Replacement
Calculate the no. of page faults for each algorithm.
Which algorithm performs best for the given reference
string?
Refer to this page request sequence A,C,B,D,A,C,E,A,C,B,D,E to
answer the following questions.
Perform a page trace...
Refer to this page request sequence A,C,B,D,A,C,E,A,C,B,D,E to
answer the following questions.
Perform a page trace analysis using three (3) page frames and
the First-In First-Out (FIFO) page replacement
algorithm.
Perform a page trace analysis using three (3) page frames and
the Least Recently Used (LRU) page replacement
algorithm.
Which page replacement algorithm performed best for this page
request sequence?
Will one page replacement algorithm always
perform better than the other?
Perform a page trace analysis using four (4) page...
Consider the following string of page references: 7, 0, 1, 2, 0,
3, 0, 4, 2,...
Consider the following string of page references: 7, 0, 1, 2, 0,
3, 0, 4, 2, 3, 0, 3, 2. The main memory can only contain THREE
frames. Show the frame allocation for: (60 points)
FIFO (First-in-First-out)
LRU (Least Recently Used)
Clock
Optimal (assume the page reference string continues with 1, 2,
0, 1, 7, 0, 1)
List the total number of page faults and the miss rate for each
policy. Count page faults only after all frames
have been...
1. What is the average waiting time for Processes If the
Operating System uses the Shortest-Job-First...
1. What is the average waiting time for Processes If the
Operating System uses the Shortest-Job-First (SJF) Scheduling
Algorithm?
(P1=5 ms, P2=10 ms, P3=15 ms)
2. How many page faults occur in the Optimum Page Replacement
algorithm (OPR) with the following reference string for three-page
frames?
Reference String: 4,2,1,3,2,3,4,1
3. What is the average waiting time for Processes If the
Operating System uses Shortest-Job-Remaining-First (SJRF)
Scheduling Algorithm?
(P1=5 ms, P2=10 ms, P3=15 ms)
Arrival Time ( P1=0 ms, P2=5...
Given that main memory is composed of only three-page frames for
public use and that a...
Given that main memory is composed of only three-page frames for
public use and that a seven-page program (with pages a, b, c, d, e,
f, g) that requests pages in the following order:
a, c, a, b, a, d, a, c, b, d, e, f
1) Using the FIFO page removal algorithm, indicate
the movement of the pages into and out of the available page frames
(called a page trace analysis) indicating each page fault with an
asterisk (*). Then...
A virtual memory has a page size of 32 words. There
are 16 pages and 8...
A virtual memory has a page size of 32 words. There
are 16 pages and 8 blocks. The associative memory page table
contains the following entries
Page Block
a) For the following CPU addresses find the virtual addresses: B5,
2A (hex)
b) For the following virtual addresses find the CPU
addresses: 1A9, 016, 149 (hex)
Page Block
0 3
4 5
7 2
9 4
12 0
13 1
14 6
15 7
Consider a process with a logical address space of 4 pages of
1024 bytes per page,...
Consider a process with a logical address space of 4 pages of
1024 bytes per page, mapped onto a physical memory of 64
frames.
A. How many bits are there in the logical address?
B. How many bits are there in the physical address?
C. Given the following page table map: page 0 is mapped to frame
3, page 1 is mapped to frame 14, page 2 to frame 6, and page 3 to
frame 33, what is the physical...