Shortest Seek Time First Scheduling
Duration: 12 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control
- Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
- Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Number Systems and Codes, Minimization of Boolean Functions, Timing, Hazards and Testing, Logic Families, Combinational Logic Design, Arithmetic Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Sequential Circuits and State Machines, Latches and Flip-Flops, Finite State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Registers and Counters, Latches and Flip-Flops, Number Systems and Codes
- Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
- Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
- Computer Networks: Introduction to CN, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Network Security, Hardware Basics
- Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
- Theory Of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Complexity Theory
- Compiler Design: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization
- C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
- Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence, Cloud Computing, Internet of Things
- Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
- Aptitude: Percentage, Ratio and Proportion (Ratios), Logarithm, HCF LCM, Average, Sequence and Series (Series), Number System, Powers and Exponents (Surds and Indices), Algebra, Permutation and Combination, Probability, Profit and Loss, Simple Interest and Compound Interest, Pipe and Cistern, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Statistics, Data Interpretation, Arithmetic, Linear Algebra, Trigonometry, Percentages, Simplification and Approximation, Number System, Ratio and Proportion, Averages, Mixtures and Alligation, Permutations and Combinations, Profit, Loss and Discount, Sequences and Series, Vocabulary, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Powers, Surds and Logarithms, Mathematical Operations, Alphabet and Word Tests, Transformation of Shapes, Signal Space and Optimum Detection, Constraint Puzzles, Mensuration, Patterns in Two-Dimensional Figures, Measurement and Quantity Take-Off, Three-Dimensional Patterns and Visualization, Numerical Reasoning, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Coding and Decoding, Series Completion, Order, Ranking and Sequence, Data Sufficiency, Differential Calculus, Wireless, Satellite and Optical Communication Systems, Complex Analysis, Vector Analysis, Trigonometry, Probability, Statistics, Differential Calculus, Algebra, Time and Work, Speed, Time and Distance, Data Interpretation, Combinatorics
- Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability, Assembling and Grouping of Shapes, Cubes and Dice, Analogy and Classification, Direction Sense, Algebra, Logical Deduction and Induction, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Time and Work, Clocks and Calendars, Data Interpretation, Blood Relations, Data Sufficiency
- English (Verbal Ability): Vocabulary, Noun, Pronoun, Adjectives, Preposition, Articles, Direct and Indirect Speech, Tenses, Conjunction, Subject Verb Agreement (Verb Noun Agreement), Modals, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Adverb, Verb, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Adjectives and Adverbs, Articles and Determiners, Voice and Reported Speech, Modals, Conditionals and Subjunctive, Blood Relations, Tenses, Vocabulary
- Engineering Mathematics: Calculus, Vectors
- GATE Live Class Recordings 2026: GATE 2026 Live Class
AI summary & chapters
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.

