SRTF Scheduling

Duration: 7 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/operating-system/cpu-scheduling/sjf-srtf-scheduling/asset-srtf-scheduling after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper-2 | Programming & Data Structures: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  3. Paper-2 | Databases / DBMS & SQL: 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
  4. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  5. Paper-2 | Computer Networks & Security: Introduction to CN, Data Communication, 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, Hardware Basics, Network Access Technologies, Network Security
  6. Paper-2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep, 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, Waveform Generators and Timer 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
  7. Paper-2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  8. Paper-2 | 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
  9. Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
  10. Paper-2 | 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, Run Time Environment
  11. Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
  12. Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning), Alphabet and Word Tests, Numerical Reasoning, Number System, Averages, Mixtures and Alligation, Percentages, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Mathematical Operations, Data Sufficiency, Direction Sense, Assembling and Grouping of Shapes, Transformation of Shapes, Three-Dimensional Patterns and Visualization, Cubes and Dice, Vocabulary, Statistics, Algebra, Geometry, Permutations and Combinations, Logical Deduction and Induction, Syllogisms and Venn Diagrams, Critical Reasoning, Order, Ranking and Sequence, Reading Comprehension, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Profit, Loss and Discount, Constraint Puzzles, Clocks and Calendars, Traverse Surveying, Simplification and Approximation, Blood Relations, Data Interpretation, Venn Diagram
  13. Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra, Ratio and Proportion, Subject-Verb Agreement, Sentence Completion, Powers, Surds and Logarithms, Data Interpretation, Sequences and Series, Trigonometry, Mensuration, Measurement and Quantity Take-Off, Signal Space and Optimum Detection, Time and Work, Probability, Algebra, Speed, Time and Distance, Statistics, Sequence and Series (Series), Combinatorics
  14. Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Structure and Correction, Modals, Conditionals and Subjunctive, Tenses, Adjectives and Adverbs, Sentence Basics, Nouns and Pronouns, Voice and Reported Speech, Articles and Determiners, Vocabulary
  15. Coal India Previous Year Paper:
  16. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
  17. Coal India Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video provides a comprehensive analysis of the Shortest Remaining Time First (SRTF) scheduling algorithm, emphasizing its pre-emptive nature and optimality in minimizing average waiting time. The instructor begins by defining SRTF as a dynamic scheduling method where the CPU is allocated to the process with the smallest remaining burst time. A critical feature highlighted is that whenever a new process enters the ready state, a scheduling decision is immediately triggered. If this new process has a smaller CPU burst requirement than the remaining time of the currently running process, pre-emption occurs. The video establishes that this specific version of SRTF is considered optimal because it guarantees the minimal average waiting time among all scheduling algorithms. The instruction then transitions to practical application, utilizing a structured table format with columns for Arrival Time (AT), Burst Time (BT), Completion Time (CT), Turn Around Time, and Waiting Time. The instructor demonstrates the algorithm by populating these tables with numerical data for processes P0 through P4, showing specific values such as an Arrival Time of 1 and Burst Time of 7 for the first process. Visual aids include a hand-drawn timeline at the bottom of the screen, which marks intervals and process identifiers like P0 to visualize execution order. The instructor modifies burst times for processes, changing values from 7 to 6 and 5 to 4, to illustrate how changes in input affect the scheduling outcome. A Gantt chart is constructed below the table, correlating visual bars with calculated time metrics. The segment concludes with a correction note regarding a calculation typo, reinforcing the importance of accuracy in deriving Turn Around Time as Completion Time minus Arrival Time.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The video introduces the Shortest Remaining Time First (SRTF) algorithm, explicitly defining it as a pre-emptive scheduling strategy. On-screen text states 'Shortest Remaining Time First (SRTF) (Pre-emptive)' and explains the core logic: 'whenever a process enters in ready state, again we make a scheduling decision.' The instructor details that if the new process has a 'smaller CPU burst requirement than the remaining CPU burst of the running process,' the current process is pre-empted. The segment concludes with a definitive statement on the algorithm's efficiency, noting 'This version (SRTF) is also called optimal is it guarantee minimal average waiting time.' This theoretical foundation sets the stage for subsequent numerical examples.

  2. 2:00 – 5:00 02:00-05:00

    The instruction shifts to a practical demonstration using a scheduling table with columns for Arrival Time, Burst Time, Completion Time, Turn Around Time, and Waiting Time. The screen displays process rows P0 through P4 populated with numerical data, such as 'Arrival Time 1 and Burst Time 7 for the first process.' A hand is seen drawing a timeline at the bottom, marking intervals and process identifiers like P0. One frame shows a completed table with handwritten calculations, including 'Turn Around Time derived as 8 minus 1 equals 7.' The instructor modifies burst times for P0 (changing 7 to 6) and P1 (changing 5 to 4), demonstrating the dynamic nature of SRTF. A man appears on screen explaining steps while pointing at row P2, and the timeline progresses with numbers 0, 1, 2, 3, and 4 indicating time units.

  3. 5:00 – 6:44 05:00-06:44

    The final segment consolidates the SRTF analysis by displaying a table with process details (P.No, Arrival Time, Burst Time) and constructing a Gantt chart below it. The instructor points at the chart to explain the progression of execution blocks P0, P1, and P2. The screen displays text labels including 'Arrival Time', 'Burst Time', 'Completion Time', 'Turn Around Time', and 'Waiting Time' alongside the header 'SRTF Scheduling'. A correction note is displayed regarding a calculation typo, emphasizing precision in the derivation of metrics. The visual correlation between table values and Gantt chart bars is maintained throughout, ensuring students understand how the abstract calculations translate into a visual timeline of process execution.

The video systematically progresses from theoretical definition to practical application, ensuring students grasp both the logic and implementation of SRTF. The core concept is pre-emption based on remaining burst time, which distinguishes it from non-pre-emptive Shortest Job First. The optimality claim is supported by the algorithm's ability to minimize average waiting time, a critical metric in operating systems. The use of tables and Gantt charts provides a dual representation: quantitative data for calculation practice and visual timelines for conceptual understanding. The instructor's modifications to burst times illustrate the algorithm's responsiveness, while the correction note highlights common pitfalls in manual calculation. This structured approach allows learners to verify their own computations against the visual evidence provided.

Loading lesson…