SJF Scheduling

Duration: 10 min

This video lesson is available to enrolled students.

Return to /learn/IOCL-ENGINEERS-OFFICERS-GRADE-A-PAPER-2/operating-system/cpu-scheduling/sjf-srtf-scheduling/asset-sjf-scheduling after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper 1 | Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) Powers and Exponents (Surds and Indices) Logarithm Sequence and Series (Series) Mensuration and Geometry Data Interpretation Average Arithmetic Simplification and Approximation Algebra Sequences and Series Profit, Loss and Discount Percentages Number System Ratio and Proportion Averages, Mixtures and Alligation Permutations and Combinations Time and Work Vocabulary Subject-Verb Agreement Sentence Completion Geometry Reading Comprehension Powers, Surds and Logarithms Trigonometry Mensuration Speed, Time and Distance Patterns in Two-Dimensional Figures Probability Measurement and Quantity Take-Off Transformation of Shapes Three-Dimensional Patterns and Visualization Statistics Mathematical Operations Data Sufficiency Constraint Puzzles Data Interpretation Mixture and Alligation Speed Time and Distance HCF LCM Algebra Profit and Loss Venn Diagram
  3. Paper 1 | Logical Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning) Series (Number and Letter Series) (Numerical Relations and Reasoning) Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning) Analogy Cubes & Dices Syllogisms Numerical Reasoning Assembling and Grouping of Shapes Coding and Decoding Cubes and Dice Series Completion Alphabet and Word Tests Analogy and Classification Direction Sense Logical Deduction and Induction Order, Ranking and Sequence Critical Reasoning Syllogisms and Venn Diagrams Narrative Sequencing Project Monitoring, Resources and Safety Simple Interest and Compound Interest Coding Decoding Seating Arrangements
  4. Paper 1 | English Language: Vocabulary Noun Pronoun Verb Adjectives Adverb Preposition Conjunction Articles Tenses Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Correction (Error Correction) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Prepositions and Conjunctions Idioms and Phrases Verb Forms and Verb Patterns Sentence Basics, Nouns and Pronouns Adjectives and Adverbs Articles and Determiners Modals, Conditionals and Subjunctive Sentence Structure and Correction Voice and Reported Speech Tenses Vocabulary
  5. Paper 1 | Unit Tests:
  6. Paper 1 | Full-Length Mock Tests:
  7. Paper 2 | Engineering Mathematics: Set Theory Relations Functions Graph Theory Group Theory Propositional and Predicate Logic Linear Algebra Calculus Permutation and Combination Probability Statistics Signal Space and Optimum Detection Probability Statistics Combinatorics
  8. Paper 2 | Digital Logic: 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
  9. Paper 2 | 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
  10. Paper 2 | Programming and 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
  11. Paper 2 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
  12. Paper 2 | Theory Of Computation/Automata Theory: 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
  13. 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
  14. 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
  15. Paper 2 | DataBase Management System/DBMS: 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 Database Recovery
  16. Paper 2 | 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 Hardware Basics
  17. Paper 2 | CS/IT Sectional Mock Tests:
  18. Complete Paper Full Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video lecture provides a comprehensive overview of CPU scheduling algorithms, specifically focusing on Shortest Job First (SJF) and Shortest Remaining Time First (SRTF). The instructor begins by defining the core principle of these algorithms: selecting the process with the smallest burst time for CPU execution. He distinguishes between the non-preemptive nature of SJF and the preemptive nature of SRTF, noting that SRTF is a 'purely greedy approach.' The lecture then transitions into a detailed numerical problem involving five processes. The instructor demonstrates how to construct a Gantt chart, calculate Completion Time (CT), Turn Around Time (TAT), and Waiting Time (WT) for each process, and finally compute the average waiting time. This practical application reinforces the theoretical concepts introduced at the start of the session.

Chapters

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

    The video opens with a slide titled 'Shortest Job First (SJF)(non-pre-emptive)' and 'Shortest Remaining Time First (SRTF)/ (Shortest Next CPU Burst) (Pre-emptive)'. The instructor explains the fundamental rule: 'Whenever we make a decision of selecting the next process for CPU execution, out of all available process, CPU is assigned to the process having smallest burst time requirement.' He clarifies that if there is a tie in burst times, First Come First Serve (FCFS) is used to break the tie. He also notes that SRTF is a 'purely greedy approach' because it supports both non-preemptive and preemptive versions. The instructor emphasizes that the decision is made based on the smallest burst time requirement among available processes. The slide text explicitly states: 'When the CPU is available, it is assigned to the process that has the smallest next CPU burst.'

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

    The instructor focuses on the non-preemptive nature of SJF. He writes on the whiteboard: 'In Shortest Job First (SJF)(non-pre-emptive) once a decision is made and among the available process, the process with the smallest CPU burst is scheduled on the CPU, it cannot be pre-empted even if a new process with the smaller CPU burst requirement then the remaining CPU burst of the running process enter in the system.' He draws a small example table with processes P1, P2, and P3, listing their Arrival Time (AT) and Burst Time (BT) to illustrate the concept. He explains that once a process starts, it runs to completion regardless of new arrivals with shorter burst times. This section sets the theoretical groundwork for the numerical problem that follows. He specifically writes 'P1 0 5', 'P2 0 4', 'P3 1 1' on the board to show a scenario where P1 starts but P3 arrives later with a smaller burst.

  3. 5:00 – 9:42 05:00-09:42

    The instructor solves a numerical problem with five processes (P0 to P4). A table shows Arrival Times (1, 2, 3, 4, 5) and Burst Times (7, 5, 1, 2, 8). He draws a Gantt chart at the bottom. P0 arrives at t=1 and runs for 7 units, finishing at t=8. At t=8, P2 (BT=1) is selected as it has the smallest burst time among available processes (P1, P2, P3, P4). P2 runs from 8 to 9. Next, P3 (BT=2) is selected, running from 9 to 11. Then P1 (BT=5) runs from 11 to 16. Finally, P4 (BT=8) runs from 16 to 24. He calculates Completion Time (CT), Turn Around Time (TAT = CT - AT), and Waiting Time (WT = TAT - BT) for each process. For example, P0 has CT=8, TAT=7, WT=0. P1 has CT=16, TAT=14, WT=9. P2 has CT=9, TAT=6, WT=5. P3 has CT=11, TAT=7, WT=5. P4 has CT=24, TAT=19, WT=11. He concludes by calculating the average waiting time. The formulas are clearly written on the slide: 'Turn Around Time (TAT) = CT - AT' and 'Waiting Time (WT) = TAT - BT'.

The lecture effectively transitions from theoretical definitions to practical application. It starts by defining SJF and SRTF, highlighting the key difference in preemption. The instructor then demonstrates the non-preemptive logic with a small board example before tackling a comprehensive numerical problem. The step-by-step calculation of CT, TAT, and WT, along with the Gantt chart, provides a clear method for solving scheduling problems. This progression ensures students understand both the 'why' and the 'how' of CPU scheduling algorithms. The 'purely greedy approach' mentioned is key to understanding why SRTF minimizes waiting time.

Loading lesson…