Q3. Consider a system in which a process is allocated three frames in memory. Given the page requests of this process as "1, 4, 5, 3, 4, 5, 6, 1, 7, 5, 6, 1, 3, 2, 6, 5, 2, 1, 5, 2", trace the utilization of the three frames by this process when using the Optimal, FIFO, LRU replacement algorithms. To compare the efficiency of using each algorithm, find the total number of page faults and the effective access time. Assume that the memory access time is 100 nanoseconds and the average page-fault service time is 4 microseconds. 0 1 2 0 1 2 0 1 2 1 Optimal Replacement 453 4561 75 613 2652 Number of page faults = Effective Access Time = 1 453 Number of page faults = Effective Access Time = FIFO Replacement Number of page faults = 1 4561756132652152 Effective Access Time = 5 LRU Replacement 1453 456175613265215 2 2

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
Q3..
Consider a system in which a process is allocated three frames in memory.
Given the page requests of this process as "1, 4, 5, 3, 4, 5, 6, 1, 7, 5, 6, 1, 3, 2, 6, 5, 2, 1, 5, 2",
trace the utilization of the three frames by this process when using the Optimal, FIFO, LRU
replacement algorithms. To compare the efficiency of using each algorithm, find the total
number of page faults and the effective access time. Assume that the memory access time
is 100 nanoseconds and the average page-fault service time is 4 microseconds.
0
1
2
0
12
0
1
2
Optimal Replacement
1453 456 175 61326 52 152
Number of page faults =
Effective Access Time =
14 5 3 4 5 6
Number of page faults=
Effective Access Time =
Number of page faults =
FIFO Replacement
Effective Access Time =
175613265215
LRU Replacement
1453 456 1756 1 3 2 6 521 52
2
Transcribed Image Text:Q3.. Consider a system in which a process is allocated three frames in memory. Given the page requests of this process as "1, 4, 5, 3, 4, 5, 6, 1, 7, 5, 6, 1, 3, 2, 6, 5, 2, 1, 5, 2", trace the utilization of the three frames by this process when using the Optimal, FIFO, LRU replacement algorithms. To compare the efficiency of using each algorithm, find the total number of page faults and the effective access time. Assume that the memory access time is 100 nanoseconds and the average page-fault service time is 4 microseconds. 0 1 2 0 12 0 1 2 Optimal Replacement 1453 456 175 61326 52 152 Number of page faults = Effective Access Time = 14 5 3 4 5 6 Number of page faults= Effective Access Time = Number of page faults = FIFO Replacement Effective Access Time = 175613265215 LRU Replacement 1453 456 1756 1 3 2 6 521 52 2
Expert Solution
Step 1

optimal replacement:-

Computer Science homework question answer, step 1, image 1

number of hit=9hit ratio =920=45%number of page fault=11fault ratio=1120=55%=0.55effective access time0·55×4000+1-0·55×100 nanosecond2200+452245 ns

FIFO replacement:-

Computer Science homework question answer, step 1, image 2

number of hit=4hit ratio=420=20%number of page fault=16fault ratio=1620=80%=0·8effective access time0·8×4000+1-0·8×100 nanosecond3200+203220ns

 

 

 

steps

Step by step

Solved in 2 steps with 3 images

Blurred answer
Knowledge Booster
Time complexity
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education