A page-replacement algorithm should minimize the number of page faults. We can do this minimization by distributing
Question:
a. Define a page-replacement algorithm using this basic idea. Specifically address the problems of (1) what the initial value of the counters is, (2) when counters are increased,
(3) When counters are decreased, and (4) how the page to be replaced is selected. b. How many page faults occur for your algorithm for the following reference string, for four page frames?
1, 2, 3, 4, 5, 3, 4, 1, 6, 7, 8, 7, 8, 9, 7, 8, 9, 5, 4, 5, 4, 2
c. What is the minimum number of page faults for an optimal page-replacement strategy for the reference string in part b with four page frames?
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
The Architecture of Computer Hardware, Systems Software and Networking An Information Technology App
ISBN: 978-1118322635
5th edition
Authors: Irv Englander
Question Posted: