SRTF Scheduling

Duration: 7 min

This video lesson is available to enrolled students.

Return to /learn/DSSSB-TGT-COMPUTER-SCIENCE-COMPLETE-COURSE/operating-system/cpu-scheduling/sjf-srtf-scheduling/asset-srtf-scheduling after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Section A: General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, History, Geography, Indian Economy, GK- Current Affairs, Evolution of Indian Banking (Banking & Financial Awareness), Environment
  3. Section A: General Intelligence & Reasoning ability: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analytical Reasoning (Counting Figures Reasoning), Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Directions (Direction Test), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Crypt Arithmetic, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability
  4. Section A: Arithmetical & Numerical Ability: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Percentage, Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Pipe and Cistern, Mensuration and Geometry, Powers and Exponents (Surds and Indices), Algebra, Probability, Mental Ability, Age Problems, Partnership, Statistics, Arithmetic, Speed Mathematics and Basic Mathematics, Miscellaneous
  5. Section A: English Language & Comprehension: Vocabulary, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Articles, Sentence Construction, Preposition, Direct and Indirect Speech, Sentence Completion (Fill in the blanks), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Modals, Active Passive Voice (Voice), Sentence Correction (Error Correction), Adverb, Conjunction, Cloze Test (Cloze Passage)
  6. Section A: Hindi Language & Comprehension: भाषा, लिपि, ध्वनि, वर्ण, अक्षर, स्वर, व्यंजन, मात्रा और संयुक्ताक्षर, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, विशेषण और क्रिया, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, संधि, समास, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, मुहावरे और लोकोक्तियाँ, अपठित गद्यांश और अपठित पद्यांश, Multi-Topic Content (Cross-Concept Material), वर्णमाला
  7. Section B: 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++, Language Design, Intro to Compilers, Visual Basics, Syntax Analysis: Bottom-Up, Object Oriented Technology
  8. Section B: 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, Mobile Computing, Net Layer:Routing Protocol, Cyber Safety and Security
  9. Section B: 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
  10. Section B: 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
  11. Section B: 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
  12. Section B: 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
  13. Section B: 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
  14. Section B: 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
  15. Section B: Python Language: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  16. Section B: 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
  17. Section B: Design & Analysis of Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  18. Section B: Mathematics: Linear Algebra, Calculus, Trigonometry, Vectors, Set Theory, Functions, Relations, Propositional and Predicate Logic, Research Process Steps, Graph Theory
  19. Section B: Computer Graphics, Multimedia & Mobile Computing: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing, Multimedia
  20. Section B: Emerging Trends: Emerging Tech Trends, Knowledge Representation, Natural Language Processing
  21. DSSSB Previous Year Paper:
  22. 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 provides a comprehensive analysis of the Shortest Remaining Time First (SRTF) scheduling algorithm, emphasizing its pre-emptive nature and optimality in minimizing average waiting time. The instructor begins by defining SRTF as a dynamic scheduling method where the CPU is allocated to the process with the smallest remaining burst time. A critical feature highlighted is that whenever a new process enters the ready state, a scheduling decision is immediately triggered. If this new process has a smaller CPU burst requirement than the remaining time of the currently running process, pre-emption occurs. The video establishes that this specific version of SRTF is considered optimal because it guarantees the minimal average waiting time among all scheduling algorithms. The instruction then transitions to practical application, utilizing a structured table format with columns for Arrival Time (AT), Burst Time (BT), Completion Time (CT), Turn Around Time, and Waiting Time. The instructor demonstrates the algorithm by populating these tables with numerical data for processes P0 through P4, showing specific values such as an Arrival Time of 1 and Burst Time of 7 for the first process. Visual aids include a hand-drawn timeline at the bottom of the screen, which marks intervals and process identifiers like P0 to visualize execution order. The instructor modifies burst times for processes, changing values from 7 to 6 and 5 to 4, to illustrate how changes in input affect the scheduling outcome. A Gantt chart is constructed below the table, correlating visual bars with calculated time metrics. The segment concludes with a correction note regarding a calculation typo, reinforcing the importance of accuracy in deriving Turn Around Time as Completion Time minus Arrival Time.

Chapters

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

    The video introduces the Shortest Remaining Time First (SRTF) algorithm, explicitly defining it as a pre-emptive scheduling strategy. On-screen text states 'Shortest Remaining Time First (SRTF) (Pre-emptive)' and explains the core logic: 'whenever a process enters in ready state, again we make a scheduling decision.' The instructor details that if the new process has a 'smaller CPU burst requirement than the remaining CPU burst of the running process,' the current process is pre-empted. The segment concludes with a definitive statement on the algorithm's efficiency, noting 'This version (SRTF) is also called optimal is it guarantee minimal average waiting time.' This theoretical foundation sets the stage for subsequent numerical examples.

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

    The instruction shifts to a practical demonstration using a scheduling table with columns for Arrival Time, Burst Time, Completion Time, Turn Around Time, and Waiting Time. The screen displays process rows P0 through P4 populated with numerical data, such as 'Arrival Time 1 and Burst Time 7 for the first process.' A hand is seen drawing a timeline at the bottom, marking intervals and process identifiers like P0. One frame shows a completed table with handwritten calculations, including 'Turn Around Time derived as 8 minus 1 equals 7.' The instructor modifies burst times for P0 (changing 7 to 6) and P1 (changing 5 to 4), demonstrating the dynamic nature of SRTF. A man appears on screen explaining steps while pointing at row P2, and the timeline progresses with numbers 0, 1, 2, 3, and 4 indicating time units.

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

    The final segment consolidates the SRTF analysis by displaying a table with process details (P.No, Arrival Time, Burst Time) and constructing a Gantt chart below it. The instructor points at the chart to explain the progression of execution blocks P0, P1, and P2. The screen displays text labels including 'Arrival Time', 'Burst Time', 'Completion Time', 'Turn Around Time', and 'Waiting Time' alongside the header 'SRTF Scheduling'. A correction note is displayed regarding a calculation typo, emphasizing precision in the derivation of metrics. The visual correlation between table values and Gantt chart bars is maintained throughout, ensuring students understand how the abstract calculations translate into a visual timeline of process execution.

The video systematically progresses from theoretical definition to practical application, ensuring students grasp both the logic and implementation of SRTF. The core concept is pre-emption based on remaining burst time, which distinguishes it from non-pre-emptive Shortest Job First. The optimality claim is supported by the algorithm's ability to minimize average waiting time, a critical metric in operating systems. The use of tables and Gantt charts provides a dual representation: quantitative data for calculation practice and visual timelines for conceptual understanding. The instructor's modifications to burst times illustrate the algorithm's responsiveness, while the correction note highlights common pitfalls in manual calculation. This structured approach allows learners to verify their own computations against the visual evidence provided.

Loading lesson…