Schedulers

Duration: 11 min

This video lesson is available to enrolled students.

Return to /learn/ZERO-TO-HERO/operating-system/process-management/schedulers-switching/asset-schedulers after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. 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, Relational Calculus, Transaction Management, Concurrency Control
  2. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  3. Digital Electronics: 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
  4. 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
  5. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
  6. 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, Network Security, Hardware Basics
  7. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  8. Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
  9. 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, Complexity Theory
  10. 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
  11. C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
  12. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence, Cloud Computing, Internet of Things
  14. Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
  15. Aptitude: Percentage, Ratio and Proportion (Ratios), Logarithm, HCF LCM, Average, Sequence and Series (Series), Number System, Powers and Exponents (Surds and Indices), Algebra, Permutation and Combination, Probability, Profit and Loss, Simple Interest and Compound Interest, Pipe and Cistern, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Statistics, Data Interpretation, Arithmetic, Linear Algebra, Trigonometry, Percentages, Simplification and Approximation, Number System, Ratio and Proportion, Averages, Mixtures and Alligation, Permutations and Combinations, Profit, Loss and Discount, Sequences and Series, Vocabulary, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Powers, Surds and Logarithms, Mathematical Operations, Alphabet and Word Tests, Transformation of Shapes, Signal Space and Optimum Detection, Constraint Puzzles, Mensuration, Patterns in Two-Dimensional Figures, Measurement and Quantity Take-Off, Three-Dimensional Patterns and Visualization, Numerical Reasoning, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Coding and Decoding, Series Completion, Order, Ranking and Sequence, Data Sufficiency, Differential Calculus, Wireless, Satellite and Optical Communication Systems, Complex Analysis, Vector Analysis, Trigonometry, Probability, Statistics, Differential Calculus, Algebra, Time and Work, Speed, Time and Distance, Data Interpretation, Combinatorics
  16. Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability, Assembling and Grouping of Shapes, Cubes and Dice, Analogy and Classification, Direction Sense, Algebra, Logical Deduction and Induction, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Time and Work, Clocks and Calendars, Data Interpretation, Blood Relations, Data Sufficiency
  17. English (Verbal Ability): Vocabulary, Noun, Pronoun, Adjectives, Preposition, Articles, Direct and Indirect Speech, Tenses, Conjunction, Subject Verb Agreement (Verb Noun Agreement), Modals, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Adverb, Verb, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Adjectives and Adverbs, Articles and Determiners, Voice and Reported Speech, Modals, Conditionals and Subjunctive, Blood Relations, Tenses, Vocabulary
  18. Engineering Mathematics: Calculus, Vectors
  19. GATE Live Class Recordings 2026: GATE 2026 Live Class
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video provides a detailed lecture on the concept of schedulers within Operating Systems, specifically focusing on the different types of schedulers and their roles in process management. The instructor begins by defining schedulers as the mechanism that selects processes from various queues for execution. The lecture progresses to distinguish between Long-term, Short-term, and Medium-term schedulers, explaining their specific functions such as admission control, CPU allocation, and swapping. Visual aids, including diagrams of process states and flowcharts, are used to illustrate how processes migrate between main memory and secondary storage. The session concludes with an explanation of the Dispatcher module, highlighting its critical role in context switching and the concept of dispatch latency.

Chapters

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

    The video opens with a slide titled 'Schedulers'. The instructor reads the definition: 'A process migrates among the various scheduling queues throughout its lifetime. The operating system must select, for scheduling purposes, processes from these queues in some fashion. The selection process is carried out by the appropriate scheduler.' He then introduces the 'Types of Schedulers' section. The first type discussed is the 'Long Term Schedulers (LTS)/Spooler'. The slide text explains that in a multiprogramming OS, more processes are submitted than can be executed immediately. Consequently, these processes are 'spooled to a mass-storage device (typically a disk), where they are kept for later execution.' The instructor emphasizes that the long-term scheduler, also called the job scheduler, selects processes from this pool and loads them into memory for execution.

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

    The instructor elaborates on the Long Term Scheduler using a hand-drawn diagram. He sketches a box labeled 'M' representing Main Memory and another labeled 'SM' for Secondary Memory, drawing an arrow to show the flow of processes. He explains that the LTS controls the degree of multiprogramming by bringing processes into main memory. He then transitions to the 'Short Term Scheduler (STS)'. The slide text states: 'The short-term scheduler, or CPU scheduler, selects from among the processes that are ready to execute and allocates the CPU to one of them.' The instructor highlights that this scheduler is invoked frequently, unlike the long-term scheduler, to manage CPU allocation efficiently among ready processes.

  3. 5:00 – 10:00 05:00-10:00

    The lecture shifts to the 'Degree of Multiprogramming', defined on the slide as 'The number of processes in memory'. The text notes that the long-term scheduler controls this degree. A key concept presented is stability: 'If the degree of multiprogramming is stable, then the average rate of process creation must be equal to the average departure rate of processes leaving the system.' The instructor draws a graph with 'n' on the y-axis to visualize this stability. He then introduces the 'Medium-term scheduler', explaining its role in swapping. The slide text reads: 'The key idea behind a medium-term scheduler is that sometimes it can be advantageous to remove a process from memory... and thus reduce the degree of multiprogramming.' He explains that this process is called swapping, where a process is swapped out to disk and later swapped back in to continue execution. A diagram shows the flow between 'partially executed swapped-out processes', 'ready queue', 'CPU', and 'I/O'.

  4. 10:00 – 11:14 10:00-11:14

    The final section covers the 'Dispatcher'. The slide defines it as 'the module that gives control of the CPU to the process selected by the short-term scheduler.' The instructor details the functions involved: 'Switching context, switching to user mode, jumping to the proper location in the user program to restart that program.' He stresses that the dispatcher must be fast because it is invoked during every process switch. The concept of 'dispatch latency' is introduced, defined as 'The time it takes for the dispatcher to stop one process and start another running.' The instructor draws a diagram illustrating context switching between two processes to visualize this rapid transfer of control.

The video effectively structures the complex topic of process scheduling by breaking it down into distinct functional modules. It establishes a clear hierarchy starting with the Long-term scheduler for admission, moving to the Short-term scheduler for CPU allocation, and the Medium-term scheduler for memory management via swapping. The lesson culminates with the Dispatcher, the low-level mechanism that executes the actual context switch. This progression helps students understand the lifecycle of a process and the specific OS components responsible for managing its execution state and resource allocation.

Loading lesson…