Pre-emptive Priority Scheduling

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/DSSSB-TGT-COMPUTER-SCIENCE-PAPER-2/operating-system/cpu-scheduling/priority-scheduling/asset-pre-emptive-priority-scheduling after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. 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++, Java Fundamentals, Array, String, IO & References, Language Design, Intro to Compilers, Visual Basics, Syntax Analysis: Bottom-Up, Object Oriented Technology
  3. 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, Cloud Computing, Mobile Computing, Net Layer:Routing Protocol, Cyber Safety and Security
  4. 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
  5. 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
  6. 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
  7. 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
  8. 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
  9. 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
  10. Python Language: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  11. 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
  12. Design & Analysis of Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  13. Mathematics - I, II, III, IV: Permutation and Combination, Logarithm, Linear Algebra, Algebra, Calculus, Trigonometry, Vectors, Set Theory, Functions, Relations, Propositional and Predicate Logic, Research Process Steps, Graph Theory
  14. Computer Graphics, Multimedia & Mobile Computing: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing, Multimedia
  15. Emerging Trends: Emerging Tech Trends, Knowledge Representation, Natural Language Processing
  16. Statistical Techniques: Probability, Statistics
  17. Interpolation - DI: Data Interpretation
  18. Basis of Physics: Physics
  19. Previous Year Paper:
  20. 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 explains the Pre-emptive Priority Scheduling algorithm in Operating Systems. The lecturer defines the concept where a higher priority process interrupts a running lower priority process, causing a context switch. He then solves a numerical problem involving six processes (P0-P5) with specific Arrival Times, Burst Times, and Priorities. The solution involves constructing a Gantt chart to determine execution order and calculating Completion Time (CT), Turnaround Time (TAT), and Waiting Time (WT) for each process.

Chapters

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

    The lecturer introduces the concept of Priority Scheduling, specifically the pre-emptive variant. He explains that once a decision is made, the process with the highest priority is scheduled on the CPU. Crucially, he notes that if a new process enters the system with a priority higher than the currently running process, a context switch occurs, and the processor is immediately provided to the new high-priority process. This establishes the core mechanism of pre-emption where higher priority tasks interrupt lower priority ones.

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

    The lecture transitions to a numerical problem involving six processes: P0 through P5. A table is displayed showing Arrival Time (AT), Burst Time (BT), and Priority for each. The lecturer begins constructing a Gantt chart to visualize the execution order. He analyzes the arrival times, noting P0 arrives at time 1, while P1 and P2 arrive at time 2. He identifies P3 as having the highest priority (8), marked as 'H' on the board. He starts drawing the timeline, marking the initial idle period and the entry of processes, preparing to determine which process runs next based on the priority rules.

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

    The lecturer completes the Gantt chart and fills in the calculation table. He determines the Completion Time (CT) for each process based on the execution order derived from the Gantt chart. For instance, P3 completes at time 8. He then calculates Turnaround Time (TAT) using the formula TAT = CT - AT and Waiting Time (WT) using WT = TAT - BT. He fills the columns with specific values, such as P0 having a CT of 18 and a WT of 13, while P3 has a WT of 0. The video concludes with the table fully populated, ready for the final average calculation.

The video provides a comprehensive guide to Pre-emptive Priority Scheduling. It starts with the theoretical definition, emphasizing the context switch mechanism when higher priority processes arrive. It then applies this theory to a concrete example, demonstrating how to manage multiple processes with varying arrival and burst times. The step-by-step construction of the Gantt chart and the subsequent calculation of performance metrics like TAT and WT offer a clear method for solving such operating system problems.

Loading lesson…