SRTF Advantage Vs Disadvantage

Duration: 8 min

This video lesson is available to enrolled students.

Return to /learn/BIHAR-STET-COMPUTER-SCIENCE-COMPLETE-COURSE/unit-5-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 the course: About the Course
  2. Mathematical Aptitude: Number System, HCF LCM, Divisibility Rules, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Time and Work, Mensuration and Geometry, Simple Interest and Compound Interest, Speed Time and Distance, Age Problems, Mixture and Alligation, Algebra, Powers and Exponents (Surds and Indices), Pipe and Cistern, Trigonometry, Statistics, Data Interpretation, Arithmetic
  3. Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Analogy, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Seating Arrangements, Syllogisms, Venn Diagram, Puzzle Solving (Puzzles), Logical Sequence Of Words, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Analytical Reasoning (Counting Figures Reasoning), Cubes & Dices, Calendar, Clock
  4. General Knowledge: Physics, Chemistry, Biology, History, Geography, Polity, Indian Economy, GK- Current Affairs, Static General Knowledge
  5. Art of Teaching: Nature, Objectives & Characteristics of Teaching, Learners & Learning Process, Factors Affecting Teaching, Methods of Teaching, Classroom Management & Communication, Teaching-Learning Aids & ICT Integration, Evaluation, Assessment & Measurement, Professional Development & Ethics, Policies, Acts & Contemporary Issues, Curriculum & School Environment, Guidance, Counselling & Mental Health, Inclusive Education & Special Needs, Micro-Teaching & Teaching Skills, Lesson Planning
  6. Environmental Science: Environment
  7. Unit 1 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  8. Unit 2 | COA: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Programming the Basic Computer
  9. Unit 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  10. Unit 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  11. Unit 4 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  12. Unit 5 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  13. Unit 6 | 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, Transaction Management, Concurrency Control
  14. Unit 7 | Computer Networks: 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
  15. Unit 8 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  16. Unit 9 | Object Oriented Programming: OOPS with C++
  17. Unit 10 | Web Development: HTML Basics, CSS, JavaScript-Basics, XML
  18. Unit 11 | 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
  19. Unit 12 | IoT: Emerging Tech Trends, Cloud Computing
  20. Unit 13 | Artificial Intelligence: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms
  21. Unit 14 | E-Commerce: Electronic Data Interchange and E-Commerce, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Physical Security and Cryptography Basics, Cyber Safety and Security
  22. Unit 15 | Multimedia: Multimedia
  23. Unit 16 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis, DSA using Python
  24. Full Length Mock Tests — General Paper:
  25. Full Length Mock Tests — Computer Science (Paper II):
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…