SRTF Implementation

Duration: 7 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-srtf-implementation 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.

This educational video lecture focuses on the Shortest Job First (SJF) CPU scheduling algorithm and addresses its primary limitation: the inability to know the exact CPU burst time of a process beforehand. To overcome this, the instructor introduces the concept of predicting the next CPU burst using the exponential averaging technique. The lecture details the mathematical formula for this prediction, defining the variables involved, including the smoothing factor alpha. The instructor provides a step-by-step calculation example on a whiteboard and demonstrates the application of the formula using a process table. Finally, the video concludes by discussing the theoretical nature of this scheme, noting its limitations when burst times vary significantly or remain constant.

Chapters

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

    The lecture begins with the instructor standing in front of a slide that states, 'As SJF is not implementable, we can use the one technique where we try to predict the CPU burst of the next coming process.' He explains that since the Shortest Job First algorithm requires knowledge of the burst time which is not available, a prediction method is necessary. The slide text further clarifies, 'The method is used as exponential averaging technique, where we consider the previous value and previous prediction.' The instructor emphasizes that this technique relies on historical data to estimate future behavior, setting the stage for the mathematical derivation to follow.

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

    The instructor transitions to the core formula displayed on the screen: 'Tau(n+1) = alpa tn + (1- alpa) tau n'. He explains that Tau(n+1) represents the predicted burst time for the next process, tn is the actual burst time of the current process, and tau(n) is the previous predicted burst time. He writes on the whiteboard to illustrate the concept, listing 'M1' with values '250' and '300'. He calculates a resulting value of '275' to show how the average works. He then discusses the parameter 'alpha' (alpha), writing 'alpha = 0', 'alpha = 1', and 'alpha = 0.5' to demonstrate how different weights affect the prediction, explaining that alpha determines the influence of the most recent history versus older history.

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

    A table appears on the screen with columns labeled 'Process', 't', and 'tau'. The rows list processes P1, P2, P3, and P4. For P1, the actual time 't' is 10 and the initial 'tau' is 20. The instructor proceeds to calculate the 'tau' values for subsequent processes based on the formula. He writes '15' in the tau column for P2 and '13.5' for P3, showing the iterative nature of the prediction. The video concludes with a slide stating, 'This idea is also more of theoretical importance as most of the time the burst requirement of the coming process may vary by a large extent and if the burst time requirement of all the process is approximately same then there is no advantage of using this scheme.' This highlights the practical limitations of the exponential averaging technique in real-world scenarios.

The video provides a comprehensive overview of how to handle the unpredictability of CPU burst times in the Shortest Job First scheduling algorithm. It moves from identifying the problem to introducing the exponential averaging formula, explaining the role of the alpha parameter, and demonstrating calculations through both whiteboard examples and a process table. The lesson concludes by contextualizing the technique as theoretically important but practically limited when process burst times are inconsistent or uniform.

Loading lesson…