Concept
Shortest Seek Time First (SSTF) 0
Shortest Seek Time First (SSTF) is a disk scheduling algorithm that selects the disk I/O request that requires the least movement of the disk's read/write head from its current position. This approach minimizes seek time, thereby potentially improving system performance, but it can also lead to starvation of requests that are far from the current head position.
Relevant Degrees