Schedulers
Duration: 11 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- Paper 2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
- Paper 2 | Computer Organization And Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Control Unit Design, Instr Formats & Modes, Programming the Basic Computer, Register Transfer and Microoperations
- Paper 2 | Analog And Digital Communication: Introduction to Communication Systems & Random Signals, Analog Communication Systems, Information Theory & Digital Communication Fundamentals, Amplitude Modulation, Communication Fundamentals and Bandpass Signals, Random Processes, Angle Modulation, Superheterodyne Receivers and Phase-Locked Loops, Noise in Communication Systems, Pulse Modulation and Pulse Code Modulation, Baseband Digital Transmission, Signal Space and Optimum Detection, Digital Modulation, Information Theory and Source Coding, Error Control Coding, Multiplexing and Multiple Access, Wireless, Satellite and Optical Communication Systems, Impedance Matching and Microwave Networks, Continuous-Time Fourier Transform, Radio Links and Propagation, Continuous-Time Fourier Series, System Properties and LTI Systems, Data Converters, Sampling and Reconstruction
- Paper 2 | Programming in C: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
- Paper 2 | Data Structures And Programming: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Java, OOPS with C++, Java Fundamentals, Array, String, IO & References, OOPS with Java, Generic & Collections, Object Oriented Technology
- Paper 2 | Algorithms: Algorithm Analysis, Sorting Algorithms, Time Complexity Analysis, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
- 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
- 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, Linux OS, Windows OS
- Paper 2 | Databases: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, File Organization & Indexing, Transaction Management, Concurrency Control
- Paper 2 | Information Systems and Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- 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
- Paper 2 | Internet & Web Technologies: Website, Browser & Services, Web Design & Development, Web Publishing & Hosting, Server Side & Security, HTML Basics, JavaScript-Basics, CSS, XML, HTML5, Basics of Computer Graphics
- Paper 2 | Cyber Security And Emerging Technologies: Emerging Tech Trends, Internet of Things, Network Security, Security in Mobile and Wireless Computing, Cyber Safety and Security, Cyber Threats and Malware Attacks, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics
- Paper 2 | Cloud Technology: Cloud Computing
- Paper 2 | Probability and statistics: Probability, Statistics
- Paper-1 English: Vocabulary, Preposition, Articles, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Analogy and Classification, Prepositions and Conjunctions, Sentence Completion, Reading Comprehension, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Sentence Structure and Correction, Articles and Determiners, Narrative Sequencing, Subject-Verb Agreement, Modals, Conditionals and Subjunctive, Tenses, Adjectives and Adverbs, Vocabulary, Verb, Sentence Construction, Modals, Adverb
- Paper 1 General Mental Ability & Logical reasoning: Ratio and Proportion (Ratios), Data Interpretation, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Average, Powers and Exponents (Surds and Indices), Algebra, Profit and Loss, Simple Interest and Compound Interest, Mensuration and Geometry, Mental Ability, Arithmetic, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Venn Diagram, Analogy, Ratio and Proportion, Vocabulary, Averages, Mixtures and Alligation, Percentages, Geometry, Powers, Surds and Logarithms, Number System, Statistics, Three-Dimensional Patterns and Visualization, Permutations and Combinations, Alphabet and Word Tests, Sequences and Series, Trigonometry, Simplification and Approximation, Mathematical Operations, Constraint Puzzles, Numerical Reasoning, Series Completion, Patterns in Two-Dimensional Figures, Coding and Decoding, Direction Sense, Assembling and Grouping of Shapes, Cubes and Dice, Profit, Loss and Discount, Probability, Mensuration, Syllogisms and Venn Diagrams, Order, Ranking and Sequence, Logical Deduction and Induction, Clocks and Calendars, Time and Work, Algebra, Data Interpretation, Speed, Time and Distance, Data Sufficiency, Blood Relations, Combinatorics
- Paper-1 General Knowledge & Current Affairs: State Wise GK, History, Geography, GK- Current Affairs, Static General Knowledge
- Full Length Mock Test:
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
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: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.
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'.
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.

