Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Write a program on this Operating system Goals The goal of this lab work is to further understand the various; Page replacement algorithm Disk scheduling

Write a program on this
Operating system
image text in transcribed
image text in transcribed
Goals The goal of this lab work is to further understand the various; Page replacement algorithm Disk scheduling algorithms * . Instructions Be original and creative as much as you can and present neat and concise solutions to the problems below. Submit your work latest by 13th November, 2018, 11:59 pm. You're to turn in your code and the screenshots of your implementation, all saved in a zip folder named; STUDENTID SURNAME and submit using the Google classroom platform. Task one Write a program that implements the FIFO, LRU, and optimal page-replacement algorithms presented in demand paging discussed in class. numbers range from 0 to 9 Apply the random page-reference string to each algorithm, and record the number of page faults incurred by each algorithm. Implement the replacement algorithms so that the number of page frames can be 3 and 4 Generated page reference: 7,0,1,2,0,3,0,4,2,3,0,3,0,3,2,1,2,0,1,7,0,1 (Minimum of 20 page references) Number of page frames: 3 State sequence: FIFO: 7- 70- 701 First, generate a random page-reference stri ng where page Number of page fault-30 RU: 7-70- 701... Number of page fault 20 OPT: 7- 70-701 Number of page fault 10 Number of page frames:4 State sequence: FIFO: 7-70-701 Number of page fault- 30 RU: 7-70- 701. Number of page fault - 20 Number of page fault 10 Task two Write a program that implements the following disk-scheduling algorithms: a. FCFS b.SST c. SCAN d. C-SCAN e.LOOK f. C-LOOK Your program will service a disk with 500 cylinders numbered 0 to 499. The program will generate a random series of 20 cylinder requests and service them according to each of the algorithms listed above. The program will be passed the initial position of the disk head (as a parameter on the command line) and report the total amount of head movement required by each algorithm. Goals The goal of this lab work is to further understand the various; Page replacement algorithm Disk scheduling algorithms * . Instructions Be original and creative as much as you can and present neat and concise solutions to the problems below. Submit your work latest by 13th November, 2018, 11:59 pm. You're to turn in your code and the screenshots of your implementation, all saved in a zip folder named; STUDENTID SURNAME and submit using the Google classroom platform. Task one Write a program that implements the FIFO, LRU, and optimal page-replacement algorithms presented in demand paging discussed in class. numbers range from 0 to 9 Apply the random page-reference string to each algorithm, and record the number of page faults incurred by each algorithm. Implement the replacement algorithms so that the number of page frames can be 3 and 4 Generated page reference: 7,0,1,2,0,3,0,4,2,3,0,3,0,3,2,1,2,0,1,7,0,1 (Minimum of 20 page references) Number of page frames: 3 State sequence: FIFO: 7- 70- 701 First, generate a random page-reference stri ng where page Number of page fault-30 RU: 7-70- 701... Number of page fault 20 OPT: 7- 70-701 Number of page fault 10 Number of page frames:4 State sequence: FIFO: 7-70-701 Number of page fault- 30 RU: 7-70- 701. Number of page fault - 20 Number of page fault 10 Task two Write a program that implements the following disk-scheduling algorithms: a. FCFS b.SST c. SCAN d. C-SCAN e.LOOK f. C-LOOK Your program will service a disk with 500 cylinders numbered 0 to 499. The program will generate a random series of 20 cylinder requests and service them according to each of the algorithms listed above. The program will be passed the initial position of the disk head (as a parameter on the command line) and report the total amount of head movement required by each algorithm

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Database And Transaction Processing

Authors: Philip M. Lewis, Arthur Bernstein, Michael Kifer

1st Edition

0201708728, 978-0201708721

More Books

Students also viewed these Databases questions