1) Given an O/S with soft timers using a single clock, consider a situation where the event list looks like this: Current time = 4105; Next Signal = 6; Clk Header → 6 → 1 → 3 → 12 → 5 a. What will current time be when the “12” signal is dispatched = b. At time 4113 a new signal arrives to be scheduled for 4125, fill in the following to reflect this signal being added at that time: Current time = ; Next Signal = ; Clk Header → 2) Given a disk with 100 tracks, Consider the following disk request sequence (track numbers): 45, 20, 90, 10, 50, 60, 80, 25, 70. The initial position of the R/W head is on track 50. Determine the distance that will be traversed by the R/W head when the Shortest Seek Time First (SSTF) algorithm is used and the Elevator algorithm (note -the Elevator algorithm will move towards 100 when it starts execution). Which algorithm will move the fewest tracks , SSTF or Elevator: , and by how many fewer tracks: tracks less than the other algorithm.
1) Given an O/S with soft timers using a single clock, consider a situation where the event list looks like this:
Current time = 4105; Next Signal = 6; Clk Header → 6 → 1 → 3 → 12 → 5
a. What will current time be when the “12” signal is dispatched =
b. At time 4113 a new signal arrives to be scheduled for 4125, fill in the following to reflect this signal being added at that time:
Current time = ; Next Signal = ; Clk Header →
2)
Given a disk with 100 tracks, Consider the following disk request sequence (track numbers): 45, 20, 90, 10, 50, 60, 80, 25, 70.
The initial position of the R/W head is on track 50.
Determine the distance that will be traversed by the R/W head when the Shortest Seek Time First (SSTF)
Step by step
Solved in 3 steps
