SRTF Scheduling

Duration: 7 min

This video lesson is available to enrolled students.

Return to /learn/IBPS-SO-IT-PRELIMS/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. English Language: Vocabulary, Noun, Adjectives, Tenses, Pronoun, Adverb, Preposition, Conjunction, Active Passive Voice (Voice), Articles, Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage)
  3. Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Puzzle Solving (Puzzles), Seating Arrangements, Blood Relations, Syllogisms, Inequality, Directions (Direction Test), Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Clock, Calendar, Analytical Reasoning (Counting Figures Reasoning), Selection Decision Table (Decision Making), Cubes & Dices, Machine Input-Output
  4. Quantitative Aptitude: Ratio and Proportion (Ratios), Data Interpretation, Mixture and Alligation, Permutation and Combination, Number System, Sequence and Series (Series), Speed Time and Distance, Algebra, Speed Mathematics and Basic Mathematics, Percentage, Average, Time and Work, Simple Interest and Compound Interest, Profit and Loss, Age Problems, Partnership, Mensuration and Geometry, Probability, IBPS Specific Videos
  5. Data Structures - Professional Knowledge: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  6. Algorithms- Professional Knowledge: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  7. Python- Professional Knowledge: Python for Placements by Yash Sir, Python Basics
  8. Operating System- Professional Knowledge: Introduction to OS, Process Management, CPU Scheduling, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management
  9. DBMS + SQL- Professional Knowledge: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), File Organization & Indexing, SQL, Transaction Management, Concurrency Control
  10. Computer Networks- Professional Knowledge: Introduction to CN, Data Communication, Net Layer: IP Addressing, Net Layer: IPv4 & Proto, Application Layer, Hardware basics, Network Security
  11. Software Engineering- Professional Knowledge: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  12. Computer Organization & Microprocessor- Professional Knowledge: Basics of COA, Cache Memory Organization, Programming the Basic Computer
  13. Digital Logic Design- Professional Knowledge: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  14. Theory of Computation- Professional Knowledge: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Regular Language Properties, Pushdown Automata & CFG, Turing Machines
  15. Compiler Design- Professional Knowledge: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Intermediate Code Gen, Code Optimization
  16. Programming Languages- Professional Knowledge: C Programming by Yash Sir, Object Oriented Programming (OOPS), Programming in C++, Java, C Language Core
  17. Emerging Tech- Professional Knowledge: Emerging Tech Trends
  18. Artificial Intelligence: Artificial Intelligence
  19. Unit Test - Professional Knowledge:
  20. Full Length 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…