2. Implement the frame replacement algorithm for virtual memory In Java For this task, you need to perform the simulation of page replacement algorithms. Create a Java program which allows the user to specify: • the total of frames currently exist in memory (F), • the total of page requests (N) to be processed, • the list or sequence of N page requests involved, For example, if N is 10, user must input a list of 10 values (ranging between 0 to TP-1) as the request sequence. Optionally you may also get additional input, the total of pages (TP) This input is optional for your program/work. It only be used to verify that each of the page number given in the request list is valid or invalid. Valid page number should be within the range 0, .. , TP-1. Page number outside the range is invalid. Then use the input data to calculate the number of page faults produced by each of the following page replacement algorithms: • First-in-first-out (FIFO) - the candidate that is the first one that entered a frame Least-recently-used (LRU)-the candidate that is the least referred / demanded • Optimal - the candidate is based on future reference where the page will be the least immediately referred / demanded. The following is an example of input and output from the expected program: Specify total frame (s) : 5 Specify the no. of request(s) provided in list : 20 Request list: 0 2 3 4 3 0 2 3 1 8 9 5 6 7 8 9 9320 Specify the total pages involved : 10 Simulation result (no. of page faults): FIFC = 13 Optional input. But good to have this to verify the page numbers in the given request list. LRU = 13 Optimal = 11
2. Implement the frame replacement algorithm for virtual memory In Java For this task, you need to perform the simulation of page replacement algorithms. Create a Java program which allows the user to specify: • the total of frames currently exist in memory (F), • the total of page requests (N) to be processed, • the list or sequence of N page requests involved, For example, if N is 10, user must input a list of 10 values (ranging between 0 to TP-1) as the request sequence. Optionally you may also get additional input, the total of pages (TP) This input is optional for your program/work. It only be used to verify that each of the page number given in the request list is valid or invalid. Valid page number should be within the range 0, .. , TP-1. Page number outside the range is invalid. Then use the input data to calculate the number of page faults produced by each of the following page replacement algorithms: • First-in-first-out (FIFO) - the candidate that is the first one that entered a frame Least-recently-used (LRU)-the candidate that is the least referred / demanded • Optimal - the candidate is based on future reference where the page will be the least immediately referred / demanded. The following is an example of input and output from the expected program: Specify total frame (s) : 5 Specify the no. of request(s) provided in list : 20 Request list: 0 2 3 4 3 0 2 3 1 8 9 5 6 7 8 9 9320 Specify the total pages involved : 10 Simulation result (no. of page faults): FIFC = 13 Optional input. But good to have this to verify the page numbers in the given request list. LRU = 13 Optimal = 11
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
Transcribed Image Text:2. Implement the frame replacement algorithm for virtual memory In Java
For this task, you need to perform the simulation of page replacement algorithms. Create a
Java program which allows the user to specify:
• the total of frames currently exist in memory (F),
the total of page requests (N) to be processed,
•
the list or sequence of N page requests involved,
For example, if N is 10, user must input a list of 10 values (ranging between 0 to
TP-1) as the request sequence.
Optionally you may also get additional input,
the total of pages (TP)
This input is optional for your program/work. It only be used to verify that each of
the page number given in the request list is valid or invalid. Valid page number
should be within the range 0, .. , TP-1. Page number outside the range is invalid.
Then use the input data to calculate the number of page faults produced by each of the
following page replacement algorithms:
• First-in-first-out (FIFO) - the candidate that is the first one that entered a frame
Least-recently-used (LRU)-the candidate that is the least referred / demanded
•
• Optimal - the candidate is based on future reference where the page will be the
least immediately referred / demanded.
The following is an example of input and output from the expected program:
Specify total frame(s) : 5
Specify the no. of request(s) provided in list: 20
Request list: 0 2 3 4 3 0 2 3 1 8 9 5 6 7 8 9 9 3 20
Specify the total pages involved : 10
Simulation result (no. of page faults):
FIFO = 13
Optional input. But good to
have this to verify the page
numbers in the given request
list.
LRU = 13
Optimal
= 11
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps with 3 images
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY