Non-Pre-emptive Priority Scheduling

Duration: 12 min

This video lesson is available to enrolled students.

Return to /learn/ASRB-ICAR-T3-T4-INFORMATION-TECHNOLOGY-PRELIMS-MAINS/operating-system/cpu-scheduling/priority-scheduling/asset-non-pre-emptive-priority-scheduling after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Prelims: General Knowledge: Physics Chemistry Biology History Geography Polity Indian Economy Static General Knowledge GK- Current Affairs Environment
  2. Prelims: General English: 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) Sentence Completion (Fill in the blanks) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Cloze Test (Cloze Passage) Verbal Analogy (Word Based Analogy) Sentence Construction Adverb Verb
  3. Prelims: Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) HCF LCM Divisibility Rules Average Sequence and Series (Series) Number System Powers and Exponents (Surds and Indices) Algebra Profit and Loss Simple Interest and Compound Interest Time and Work Pipe and Cistern Speed Time and Distance Mixture and Alligation Mensuration and Geometry Age Problems Partnership Statistics Data Interpretation Arithmetic
  4. Prelims: General Agriculture: Agriculture in India and Tripura Natural Resource Management Fundamentals of Crop Production Horticulture Crop Improvement Crop Protection Social Science
  5. IT Mains: Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management Distributed Systems
  6. IT Mains: Computer Networking: Introduction to CN 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
  7. IT Mains: DBMS: Basics of DBMS ER Diagram Relational Model & Functional Dependencies Keys & Integrity Constraints Normalization (1NF - BCNF) Decomposition Properties & 4NF Relational Algebra SQL Relational Calculus Transaction Management Concurrency Control Database Recovery Big Data Systems Database Security & Authorization Enhanced Data Models NoSQL
  8. IT Mains: Software Engineering: Fundamentals of Software Engineering Software Requirements and Quality Assurance Software Design, Estimation and Metrics Software Testing Software Maintenance and Configuration Management
  9. IT Mains: Data Structures & Algorithms: Introduction to DS Array Stack Queue Linked List Tree Graphs Hashing Algorithm Analysis Time Complexity Analysis Sorting Algorithms
  10. IT Mains: OOPS with C++ & Java: C Fundamentals OOPS with C++ Java Fundamentals Array, String, IO & References OOPS with Java Generic & Collections Multithreading File Handling & I/O
  11. IT Mains: Python: Introduction to Python Tokens, Variables, Data Types, I/O Operators & Expressions Control Flow & Looping Collections & Strings Functions & Modules
  12. IT Mains: Website Development: Website, Browser & Services Internet Fundamentals Web Design & Development Protocols & Services Web Publishing & Hosting Server Side & Security Emerging Technologies HTML Basics HTML5 CSS JavaScript-Basics .Net Programming PHP
  13. IT Mains: Mobile App Development: Mobile Computing Multimedia
  14. IT Mains: Linux / Windows Server Admin: Unix OS Linux OS
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video provides a comprehensive lecture on Priority Scheduling in Operating Systems. The instructor begins by defining the algorithm, explaining that each process is assigned a priority number, and the CPU is allocated to the process with the highest priority. He clarifies that 'highest priority' can be represented by either the highest or lowest number depending on the system's convention. The lecture covers tie-breaking mechanisms using First-Come-First-Served (FCFS) order and notes that the algorithm supports both pre-emptive and non-pre-emptive versions. The second half of the video features a detailed numerical example involving six processes (P0 to P5). The instructor constructs a Gantt chart to determine the execution sequence based on priority values and arrival times. He then calculates the Completion Time (CT), Turn Around Time (TAT), and Waiting Time (WT) for each process using standard formulas, filling out a data table to demonstrate the final results.

Chapters

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

    The instructor introduces the concept of Priority Scheduling. The slide text states: 'Here a priority is associated with each process. At any instance of time out of all available process, CPU is allocated to the process which possess highest priority (may be higher or lower number).' He explains that a priority number is assigned to every process. He writes 'P1 - 5' and 'P2 - 3' on the screen to illustrate that priority is just a number. He mentions that if priorities are equal, the tie is broken using FCFS order. He also states that there is no importance to seniority or burst time in this algorithm.

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

    The instructor elaborates on the characteristics of Priority Scheduling. He draws a diagram of a queue to visualize how processes wait. He emphasizes that the algorithm supports both non-pre-emptive and pre-emptive versions. He explains that the CPU is always given to the process with the highest priority among the available ones. He clarifies that 'highest priority' might mean the highest number (e.g., 8 is higher than 5) or the lowest number (e.g., 1 is higher than 5), depending on the specific implementation. He reiterates that burst time does not influence the scheduling decision, only the priority value matters.

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

    The lecture transitions to a numerical example. A table appears with columns: P. No, AT (Arrival Time), BT (Burst Time), Priority, CT, TAT, and WT. The data includes processes P0 through P5 with varying priorities. P3 has a priority of 8(H), indicating High priority. The instructor draws a Gantt chart at the bottom of the screen. He determines the execution order: P0 starts at t=1. At t=5, P3 (Priority 8) is selected. At t=10, P2 (Priority 7) is selected. At t=13, P5 (Priority 6) is selected. For P1 and P4, which both have Priority 5, he applies FCFS, so P1 runs before P4. He writes the sequence P0, P3, P2, P5, P1, P4 on the timeline.

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

    The instructor completes the numerical solution by calculating the metrics for each process. He fills the CT column: P0=5, P3=10, P2=13, P5=15, P1=17, P4=18. He then calculates TAT using the formula 'TAT = CT - AT'. For P0, TAT is 5-1=4. For P1, TAT is 17-2=15. He proceeds to calculate WT using 'WT = TAT - BT'. For P0, WT is 4-4=0. For P1, WT is 15-2=13. He fills the entire table row by row, pointing to the values and explaining the arithmetic for each process to ensure students understand how the final metrics are derived from the Gantt chart.

The video effectively bridges theory and practice in Priority Scheduling. It starts by establishing the core rule: CPU allocation is driven by priority numbers, not burst time or arrival time, though arrival time dictates availability. The instructor clarifies the ambiguity of 'highest priority' (high number vs low number) and the role of FCFS in tie-breaking. The practical application involves a step-by-step execution of a Gantt chart where the scheduler dynamically picks the highest priority process available at each time unit. The final segment focuses on performance evaluation, calculating Turn Around Time and Waiting Time for each process, reinforcing the formulas TAT = CT - AT and WT = TAT - BT. This progression ensures students understand both the logic of the scheduler and the method for evaluating its efficiency.

Loading lesson…