2.2 Part B Write a C program called sstf.c that implements the SSTF disk scheduling algorithm. As in Part A, the set of requests" to the disk (cylinders/tracks to be read) should be provided as...

1 answer below »

2.2 Part B Write a C program called sstf.c that implements the SSTF disk scheduling algorithm. As in Part A, the set of requests" to the disk (cylinders/tracks to be read) should be provided as command-line arguments to your program, and the output of your program should show the order in which the cylinders/tracks are read, and the total distance traveled. Assume the disk arm starts at cylinder/track 50. Note: the SSTF algorithm looks for the track closest to where the disk arm currently is positioned, not to where it started. In the case where two tracks are both equally as close to the current position, you can choose either one (the higher one or the lower one), as long as it's a "local" decision (ie, you do not consider what you'll do after that) 2.3 Part C Write a C program called look.c that implements the LOOK disk scheduling algorithm. As in Parts A and B, the set of "requests" to the disk (cylinders/tracks to be read) should be provided as command-line arguments to your program, and the output of your program should show the order in which the cylinders/tracks are read, and the total distance traveled. Assume the disk arm starts at cylinder/track 50. Note: assume that the disk arm is moving down at the start of your program. And when you calculate the total distance, include the distance of the "giant leap."

Answered 82 days After Nov 21, 2021

Solution

Sathishkumar answered on Feb 12 2022

129 Votes

SOLUTION.PDF

2.2 Part B Write a C program called sstf.c that implements the SSTF disk scheduling algorithm. As in Part A, the set of requests" to the disk (cylinders/tracks to be read) should be provided as...

Solution

Answer To This Question Is Available To Download

Related Questions & Answers

Submit New Assignment