SRTF Advantage Vs Disadvantage

Duration: 8 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-advantage-vs-disadvantage 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.

The video lecture provides a detailed analysis of the Shortest Job First (SJF) CPU scheduling algorithm, focusing on its pros and cons. The instructor begins by establishing the theoretical superiority of the pre-emptive version, noting it guarantees minimal average waiting time and is often called the "optimal algorithm." He explains that it sets a standard for other algorithms and provides better response times than FCFS. The lecture then shifts to the critical disadvantages, highlighting that the algorithm is practically unimplementable because the system cannot predict the length of the next CPU burst. This limitation causes "starvation," where long processes wait indefinitely. The instructor uses a visual analogy of a busy street food stall to illustrate how longer processes suffer from poor response times and starvation.

Chapters

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

    The instructor focuses on the "Advantage" slide. He reads and underlines the first point: "Pre-emptive version guarantees minimal average waiting time so some time also referred as optimal algorithm." He emphasizes that "Pre-emptive version" is key here. He explains that because it minimizes waiting time, it is mathematically optimal. He then moves to the second point, "Provide a standard for other algo in terms of average waiting time," underlining "Provide a standard." He explains that other algorithms are judged against SJF's performance. Finally, he discusses the third point, "Provide better average response time compare to FCFS," underlining "Provide better average response time." He contrasts this with FCFS, where a long process at the front can delay short processes.

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

    The slide changes to "Disadvantage." The instructor underlines the first point: "This algo cannot be implemented as there is no way to know the length of the next CPU burst." He stresses that "cannot be implemented" is the core issue. The second point states, "Here process with the longer CPU burst requirement goes into starvation." He underlines "longer CPU burst requirement" and circles "starvation." The third point reads, "No idea of priority, longer process has poor response time." He underlines "No idea of priority." An image of a street vendor serving customers is displayed, which he uses as a visual aid to explain the concept of waiting lines and how some people (processes) might wait much longer than others.

  3. 5:00 – 7:55 05:00-07:55

    The instructor elaborates on the starvation problem using the visual analogy. He explains that if short processes keep arriving, the long process at the back of the queue never gets served. He circles "starvation" again to reinforce the concept. He discusses the third point, "No idea of priority," explaining that without priority, a long process has poor response time. He mentions that this is why pure SJF is not used; instead, approximations are made. He gestures towards the image of the food stall, comparing the customers waiting for food to processes waiting for the CPU. He concludes that while SJF is theoretically optimal, its practical implementation is flawed due to the unpredictability of CPU bursts.

The lecture bridges the gap between theory and practice for SJF. It confirms the algorithm's theoretical optimality for waiting time but clearly identifies the fatal flaw of unimplementability due to unknown burst lengths. This leads to the critical issue of starvation, where long processes are neglected. The visual analogy of the food stall effectively grounds the abstract concept of starvation in a relatable real-world scenario, helping students understand why priority scheduling or aging techniques are necessary in real operating systems.

Loading lesson…