Shortest Seek Time First Scheduling
Duration: 12 min
This video lesson is available to enrolled students.
AI Summary
An AI-generated summary of this video lecture.
This educational video delivers a detailed lecture on the Shortest Seek Time First (SSTF) disk scheduling algorithm used in operating systems. The session begins by defining the algorithm's core heuristic: prioritizing requests that are physically closest to the current position of the disk read/write head. The instructor provides a step-by-step numerical example on the whiteboard to illustrate how the head moves to service requests, calculating the total seek time. The lecture then transitions into a critical analysis, presenting a slide that lists the specific advantages, such as decreased seek movements and increased throughput, alongside significant disadvantages like the overhead of calculating distances and the risk of starvation. The instructor uses diagrams to visually explain how the head can get trapped servicing nearby requests, leaving distant ones waiting indefinitely, and draws a parallel between SSTF and Shortest-Job-First (SJF) scheduling to reinforce the concept of starvation.
Chapters
0:00 – 2:00 00:00-02:00
The instructor introduces the concept of SSTF scheduling, standing next to a slide titled "SSTF Scheduling." He explains the fundamental assumption: "It seems reasonable to service all the requests close to the current head position before moving the head far to service other REQUESTS." He writes a list of cylinder numbers on the board—47, 93, 3, 51, 29, 78—to create a scenario for the algorithm. He circles the number 40, indicating the current head position, and begins to explain that the request nearest to the disk arm will get executed first, effectively minimizing the seek time for the immediate next step. He notes that while this is an improvement over FCFS, it is not necessarily optimal, setting the stage for the example that follows.
2:00 – 5:00 02:00-05:00
The instructor continues the worked example, demonstrating the decision-making process of the SSTF algorithm. He points to the slide text which states, "In the example, we can do better by moving the head from 53 to 37, even though the latter is not closest." He writes calculations on the board, such as "57 - 29 = 28," to show the distance between cylinders. He emphasizes the efficiency of the strategy by underlining the text "This strategy reduces the total head movement to 208 cylinders," contrasting it implicitly with the less efficient First-Come-First-Served (FCFS) algorithm mentioned in the text. He uses his hand to trace the path of the head on the slide, showing how the head moves to the nearest request before turning around.
5:00 – 10:00 05:00-10:00
The presentation shifts to a slide listing the "Advantages" and "Disadvantages" of SSTF. The instructor marks checkmarks next to the advantages: "Seek movements decreases," "Average Response Time decreases," and "Throughput increases." He then focuses on the disadvantages, specifically highlighting "Overhead to calculate the closest request" and "Can cause Starvation for a request which is far from the current location of the header." To illustrate starvation, he draws a diagram showing the disk head moving back and forth between two close requests while a third request far away remains unserviced, visually demonstrating the "High variance of response time" mentioned on the slide. He points to the text "SSTF favours only some requests" to explain why the response time variance is high.
10:00 – 11:45 10:00-11:45
The instructor concludes the lesson by drawing a direct comparison between SSTF and Shortest-Job-First (SJF) scheduling. He points to the text "SSTF scheduling is essentially a form of shortest-job-first (SJF) scheduling," explaining that just like SJF, SSTF may cause starvation of some requests. He circles the term "SSTF" in the disadvantage section to reinforce that while the algorithm is efficient for average response time, it is not optimal for all requests. He reiterates that the algorithm favors requests close to the current head position, leading to the potential neglect of distant requests, which is a critical consideration for system designers. He emphasizes that this is a form of "shortest-job-first" scheduling and that "like SJF scheduling, it may cause starvation of some requests."
The video effectively bridges the gap between theoretical definition and practical application of SSTF scheduling. It starts with the fundamental logic of minimizing seek time, moves to a concrete numerical demonstration to show how the algorithm operates, and concludes with a critical evaluation of its trade-offs. The instructor uses visual aids like board calculations and diagrams to clarify complex concepts like starvation, making the comparison to SJF scheduling clear and memorable for students. The progression from definition to example to pros/cons provides a complete understanding of the algorithm's role in operating systems, ensuring students grasp both the efficiency gains and the potential pitfalls of the strategy.