Pre-emptive Vs Non-Pre-emptive Scheduling

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/RSSB-SENIOR-COMPUTER-INSTRUCTOR/operating-systems/cpu-scheduling/basics-criteria/asset-pre-emptive-vs-non-pre-emptive-scheduling after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the Course: About the Course
  2. Paper-1 & 2 | Basic Numeracy: Ratio and Proportion (Ratios), Divisibility Rules, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Percentage, Average, Mensuration and Geometry, Age Problems, Arithmetic, Statistics, Probability, Profit and Loss, Simple Interest and Compound Interest, Partnership, Speed Mathematics and Basic Mathematics, Algebra, Powers and Exponents (Surds and Indices), Time and Work, Pipe and Cistern, RSSB Specific Videos - Basic Numeracy
  3. Paper-1 & 2 | Data Interpretation: Data Interpretation
  4. Paper-1 & 2 | General Mental Ability: Mental Ability, RSSB Specific Videos - Mental Ability
  5. Paper-1 & 2 | Logical Reasoning and Analytical Ability: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Syllogisms, Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Venn Diagram, Analogy, Ranking, Order and Sequence, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Data Arrangement, Logical Sequence Of Words, Crypt Arithmetic
  6. Paper-1 & 2 | Decision Making and Problem Solving: Selection Decision Table (Decision Making)
  7. Paper-1 | General Science: Physics, Biology, Chemistry, RSSB Specific Videos
  8. Paper-1 | General Awareness: State Wise GK, GK- Current Affairs
  9. Paper-2 | Fundamentals of Computer: Basics of COA, Number System, Floating Point Rep, Number Representation
  10. Paper - 2 | Digital Logic Systems: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits
  11. Paper-2 | Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Linux OS, Distributed Systems
  12. Paper-2 | Database Management System: 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
  13. Paper-2 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  14. Paper-2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  15. Paper 2 | Oops, C++, Java: Language Design, OOPS with C++, Java, .Net Programming, Java Fundamentals
  16. Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  17. Paper 2 | Emerging Trends and AI: Emerging Tech Trends, Artificial Intelligence
  18. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Advanced Algorithms
  19. Paper 2 | Data Communication and Network Security: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, 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, Network Security, Ethical Hacking
  20. Paper-2 I Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  21. Paper-2 | Computer Organization and Architecture: Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations
  22. Paper-2 | Web Development: JavaScript-Basics, HTML Basics, CSS, XML
  23. Pedagogy: Child Development, Concept of Pedagogy, Psychology, Theories, Inclusive Education, Experiential Pedagogy, Curriculum Framework & Reforms, National Education Policy (NEP) 2020
  24. Live Sessions: RSSB Live Sessions
  25. RSSB Paper 1 - Full Mock Tests:
  26. RSSB Paper 2 - Full Mock Tests:
  27. SCI Previous Year Papers:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video lecture focuses on the fundamental types of process scheduling in operating systems, specifically contrasting Non-Preemptive and Preemptive scheduling strategies. The instructor begins by defining Non-Preemptive scheduling, emphasizing that once a process is allocated the CPU, it retains control until it voluntarily releases it. This is illustrated through a state transition diagram where a process moves from Running to Terminated upon completion or to Blocked when waiting for I/O. The lecture then transitions to Preemptive scheduling, where the operating system can forcibly remove a process from the CPU. This section details four specific scenarios for CPU release, including completion, voluntary I/O requests, high-priority process arrival, and time quantum expiration. The instructor uses a modified state diagram to visually represent these transitions, highlighting the additional paths from Running back to Ready that characterize preemptive behavior.

Chapters

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

    The instructor introduces Non-Preemptive scheduling, defining it as a strategy where a process keeps the CPU until it releases it willingly. On-screen text explicitly states: 'Under Non-Pre-emptive scheduling, once the CPU has been allocated to a process, the process keeps the CPU until it releases the CPU willingly.' He explains that a process leaves the CPU only in two specific cases: first, when it completes execution (Termination state), and second, when it voluntarily performs I/O operations (Blocked state). He draws a state transition diagram showing the flow from Start to Ready, then to Running. From Running, he draws an arrow labeled '1' pointing to Terminated and another arrow labeled '2' pointing to Blocked, which then loops back to Ready. This visual aid reinforces the concept that the process is not forced out during execution, ensuring it runs to completion or until it explicitly requests a resource.

  2. 2:00 – 4:48 02:00-04:48

    The lecture shifts to Preemptive scheduling, where a process can be forced out of the CPU. The on-screen text reads: 'Under Pre-emptive scheduling, once the CPU has been allocated to a process, A process will leave the CPU willingly or it can be forced out.' The instructor lists four conditions for leaving the CPU: completion of execution, voluntary I/O operations, arrival of a high-priority process, and time quantum expiration. He updates the state diagram to show arrows labeled '3' and '4' moving from Running back to Ready, representing the forced preemption scenarios. He explains that unlike the previous model, the OS can interrupt the running process if a higher priority task arrives or if the time slice expires, forcing the process back into the Ready queue. This highlights the dynamic nature of preemptive systems where the scheduler has more control over resource allocation.

The video effectively contrasts two core scheduling philosophies. Non-preemptive scheduling relies on the process's voluntary cooperation to release the CPU, limiting transitions to completion or I/O waits. Preemptive scheduling introduces OS control, allowing the system to interrupt running processes for higher priority tasks or time limits. The visual progression from a simple state diagram to a more complex one with additional feedback loops clearly demonstrates the increased flexibility and complexity of preemptive systems. Understanding these distinctions is crucial for analyzing system performance and responsiveness in operating system design.

Loading lesson…