SSTF scheduling
SSTF scheduling
The correct option is B All of the above
SSTF scheduling:-
Shortest seek time
first (SSTF) is a secondary storage scheduling algorithm to determine the motion of the
disk's arm and head in servicing read and write requests.
In SSTF (Shortest Seek Time First), requests
having shortest seek time are executed first. So, the seek time of every
request is calculated in advance in queue and then they are scheduled according
to their calculated seek time. As a result, the request near the disk arm will
get executed first. SSTF is certainly an improvement over FCFS as it decreases
the average response time and increases the throughput of system.
This algorithm selects the request with
minimum seek time from the current head position that means the closest request
will be serviced first.
The main disadvantage of SSTF is that it may
cause starvation of
some request that is far away from the head position.
SSTF scheduling:-
Shortest seek time first (SSTF) is a secondary storage scheduling algorithm to determine the motion of the disk's arm and head in servicing read and write requests.
In SSTF (Shortest Seek Time First), requests having shortest seek time are executed first. So, the seek time of every request is calculated in advance in queue and then they are scheduled according to their calculated seek time. As a result, the request near the disk arm will get executed first. SSTF is certainly an improvement over FCFS as it decreases the average response time and increases the throughput of system.
This algorithm selects the request with minimum seek time from the current head position that means the closest request will be serviced first.
The main disadvantage of SSTF is that it may cause starvation of some request that is far away from the head position.
