SRTF Implementation

Duration: 7 min

This video lesson is available to enrolled students.

Return to /learn/DSSSB-TGT-COMPUTER-SCIENCE-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. Programming, Data Structures, OOP & Java: 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, Java, OOPS with C++, Java Fundamentals, Array, String, IO & References, Language Design, Intro to Compilers, Visual Basics, Syntax Analysis: Bottom-Up, Object Oriented Technology
  3. Computer Networks, TCP/IP & Network Security: Introduction to CN, Data Communication, DLL: Flow Control, DLL: Access Control, DLL: Error Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics, Network Access Technologies, Network Security, Society, Law & Ethics, Cloud Computing, Mobile Computing, Net Layer:Routing Protocol, Cyber Safety and Security
  4. Teaching Methodology: Child Development, Concept of Pedagogy, Theories, Inclusive Education, Experiential Pedagogy, Assessment & Evaluation, Curriculum Framework & Reforms, National Education Policy (NEP) 2020, Psychology, Teaching-Learning Process, Personality Development, Teaching Methods & Strategies, Learning and Motivation, Learners & Learning Process, Factors Affecting Teaching, Methods of Teaching, Nature, Objectives & Characteristics of Teaching, Teaching-Learning Aids & ICT Integration, Classroom Management & Communication, Evaluation, Assessment & Measurement, Curriculum & School Environment, Inclusive Education & Special Needs, Professional Development & Ethics
  5. Digital Electronics / Boolean Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Analog-Digital Conversion
  6. Operating Systems & Linux: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, File Management, Disc Scheduling, Unix OS, Linux OS, Distributed Systems, Windows OS
  7. Data Base Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, File Organization & Indexing, Transaction Management, Concurrency Control, Database Security & Authorization, Database Recovery, Data Warehousing & Mining
  8. Internet & Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, HTML Basics, CSS, Emerging Technologies, JavaScript-Basics, .Net Programming, Electronic Data Interchange and E-Commerce, XML
  9. Computer Fundamentals, IT Basics & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer, Terms & Abbreviations, MS Office Applications, Instr Formats & Modes, Floating Point Rep
  10. Python Language: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  11. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, extras, Fundamentals of Systems and Information Systems
  12. Design & Analysis of Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  13. Mathematics - I, II, III, IV: Permutation and Combination, Logarithm, Linear Algebra, Algebra, Calculus, Trigonometry, Vectors, Set Theory, Functions, Relations, Propositional and Predicate Logic, Research Process Steps, Graph Theory
  14. Computer Graphics, Multimedia & Mobile Computing: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing, Multimedia
  15. Emerging Trends: Emerging Tech Trends, Knowledge Representation, Natural Language Processing
  16. Statistical Techniques: Probability, Statistics
  17. Interpolation - DI: Data Interpretation
  18. Basis of Physics: Physics
  19. Previous Year Paper:
  20. Business Studies and Management: Business Communication, Business Organization and Management, Financial Accounting, Business Economics, Management Information System (MIS), Knowledge Management & New Economy
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…