Priority Scheduling Advantage Vs Disadvantage

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/UPPSC-POLYTECHNIC-LECTURER-2025-CS/paper-2-operating-systems/cpu-scheduling/priority-scheduling/asset-priority-scheduling-advantage-vs-disadvantage after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: UPPSC Course Overview
  2. Interview Preparation & Guidance: Interview Preparation
  3. Paper 1 | General Hindi: भाषा, लिपि, ध्वनि, वर्ण, अक्षर, स्वर, व्यंजन, मात्रा और संयुक्ताक्षर, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, विशेषण और क्रिया, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, वर्णमाला, समास, संधि, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, मुहावरे और लोकोक्तियाँ, अपठित गद्यांश और अपठित पद्यांश, Multi-Topic Content (Cross-Concept Material)
  4. Paper 2 | General Studies: State Wise GK, Polity, Geography, History, GK- Current Affairs
  5. Paper 1 | Programming Language: Language Design, C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++
  6. Paper 1 | Database Management Systems: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, ORDBMS, NoSQL
  7. Paper 1 | Cyber Security: Society, Law & Ethics, 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, Intrusion Detection Systems (IDS), Cyber Safety and Security, Ethical Hacking
  8. Paper 1 | Computer Organization and Architecture: Basics of COA, Programming the Basic Computer, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design
  9. Paper 1 | Computer Networks: Introduction to CN, Data Communication, 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, Network Security
  10. Paper 1 | Design and Analysis of Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  11. Paper 1 | Data Structures: Introduction to DS, Array, Linked List, Stack, Queue, Tree, Graphs, Hashing
  12. Paper 1 | Discrete Structures and Theory of Logic: Permutation and Combination, Set Theory, Relations, Functions, Propositional and Predicate Logic, Graph Theory, Group Theory
  13. Paper 1 | Software Project Management: Software Project Management
  14. Paper 2 | Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Security
  15. 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, Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Pushdown Automata & CFG, Complexity Theory
  16. Paper 2 | Artificial Intelligence & High Performance Computing: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Natural Language Processing, Emerging Tech Trends
  17. Paper 2 | Image Processing: Digital Image Fundamentals, Image Enhancement, Image Restoration, Color Image Processing, Image Compression
  18. Paper 2 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  19. Paper 2 | Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing
  20. Paper 2 | Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, HTML Basics, JavaScript-Basics, Java
  21. Paper 2 | Soft Computing: Fuzzy Sets, Artificial Neural Networks, Genetic Algorithms
  22. Paper 2 | Distributed System: Distributed Systems
  23. UPPSC Live Class Recordings: UPPSC Polytechnic Lecturer 2025 (CS)
  24. Previous Year Papers:
  25. Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video lecture, presented by Sanchit Jain Sir from Knowledge Gate Educator, delves into the Priority Scheduling algorithm within Operating Systems. The session systematically breaks down the pros and cons of this scheduling method before introducing a specific technique to mitigate its primary drawback. The instructor utilizes a digital whiteboard to display bullet points, which he annotates with checkmarks and circles to emphasize critical concepts for students preparing for exams like GATE. The content is structured to first establish why the algorithm is useful, then identify its flaws, and finally present a standard solution used in real-world systems.

Chapters

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

    The lecture begins by outlining the benefits of Priority Scheduling. The slide titled Advantage displays two main points: Gives a facility specially to system process and Allow us to run important process even if it is a user process. The instructor explains that this algorithm is particularly useful because it ensures that critical system tasks or high-priority user applications are executed first, preventing them from being delayed by less important background tasks. He gestures towards the text to reinforce that this flexibility is a key strength of the method, allowing the OS to manage resources efficiently based on importance.

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

    The discussion shifts to the downsides of the algorithm on a slide titled Disadvantage. The text highlights that Here process with the smaller priority may starve for the CPU and notes there is No idea of response time or waiting time. The instructor underlines these phrases to stress the severity of the issue. He elaborates on the concept of starvation, where low-priority processes might wait indefinitely if high-priority processes continuously arrive, effectively starving the lower-priority ones of CPU time. He also points out the unpredictability of waiting times for users, making it difficult to guarantee service levels for all processes in the system.

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

    To resolve the starvation issue, the instructor introduces a solution called Ageing. The slide defines it as a technique of gradually increasing the priority of processes that wait in the system for long time. An example is provided: E.g. priority will increase after every 10 mins. The instructor circles the term Ageing and the time interval 10 mins to highlight the mechanism. He explains that by incrementally raising the priority of waiting processes, the system ensures that even low-priority tasks eventually get executed, thus preventing indefinite starvation. This technique effectively balances the need for high-priority execution with fairness for all processes.

The lecture provides a comprehensive overview of Priority Scheduling, moving logically from its utility in prioritizing critical tasks to the significant risk of starvation it poses. By introducing Ageing as a countermeasure, the instructor offers a complete picture of how modern operating systems manage process priorities effectively. This progression helps students understand not just the algorithm itself, but also the practical engineering solutions used to handle its inherent limitations, ensuring a balanced approach to CPU resource allocation.

Loading lesson…