Schedulers

Duration: 11 min

This video lesson is available to enrolled students.

Return to /learn/IBPS-SO-IT-MAINS/operating-system/process-management/schedulers-switching/asset-schedulers after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. English Language: Vocabulary, Noun, Adjectives, Tenses, Pronoun, Adverb, Preposition, Conjunction, Active Passive Voice (Voice), Articles, Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage)
  3. Quantitative Aptitude & Numerical Ability: Ratio and Proportion (Ratios), Data Interpretation, Mixture and Alligation, Permutation and Combination, Number System, Sequence and Series (Series), Speed Time and Distance, Algebra, Speed Mathematics and Basic Mathematics, Percentage, Average, Time and Work, Simple Interest and Compound Interest, Profit and Loss, Age Problems, Partnership, Mensuration and Geometry, Probability, IBPS Specific Videos
  4. Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Puzzle Solving (Puzzles), Seating Arrangements, Blood Relations, Syllogisms, Inequality, Directions (Direction Test), Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Clock, Calendar, Analytical Reasoning (Counting Figures Reasoning), Selection Decision Table (Decision Making), Cubes & Dices, Machine Input-Output
  5. Data Structures- Professional Knowledge: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  6. Algorithms- Professional Knowledge: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  7. Python- Professional Knowledge: Python for Placements by Yash Sir, Collections & Strings, Functions & Modules, File Handling & Data Analysis, Python Basics
  8. Operating System- Professional Knowledge: Introduction to OS, Process Management, Process Synchronization, CPU Scheduling, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Windows OS
  9. DBMS + SQL- Professional Knowledge: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), File Organization & Indexing, SQL, Transaction Management, Concurrency Control, Relational Algebra, Relational Calculus, NoSQL, Data Warehousing & Mining
  10. Computer Networks- Professional Knowledge: Introduction to CN, Data Communication, Net Layer: IP Addressing, Net Layer: IPv4 & Proto, Application Layer, Hardware basics, Network Security, Transport Layer Services, DLL: Flow Control, Cloud Computing
  11. Software Engineering- Professional Knowledge: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  12. Computer Organization & Microprocessor- Professional Knowledge: Basics of COA, Cache Memory Organization, Programming the Basic Computer, Instr Formats & Modes
  13. Digital Logic Design- Professional Knowledge: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  14. Theory of Computation- Professional Knowledge: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Regular Language Properties, Pushdown Automata & CFG, Turing Machines
  15. Compiler Design- Professional Knowledge: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Intermediate Code Gen, Code Optimization
  16. Programming Languages- Professional Knowledge: C Programming by Yash Sir, Language Design, DMA, Macros, Scoping & File Handling, Object Oriented Programming (OOPS), Programming in C++, Java, HTML, C Language Core
  17. Emerging Tech- Professional Knowledge: Emerging Tech Trends, MS Office Applications
  18. Artificial Intelligence: Artificial Intelligence
  19. Image Processing: Digital Image Fundamentals
  20. Internet & Web Technology: Website, Browser & Services, Internet Fundamentals, Server Side & Security, Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Cyber Safety and Security, Ethical Hacking
  21. Descriptive Paper: English Writing Ability
  22. Mains - Unit Tests:
  23. Mains - Full Mock Tests:
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…