Priority Scheduling Advantage Vs Disadvantage

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/UP-LT-GRADE-ASSISTANT-TEACHER-2025/cs-06-operating-system/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: About the Course
  2. CS | 01 | Digital Logic and Circuits and Discrete Mathematical Structures: Digital Systems & Boolean Basics, Number System, Number Representation, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Permutation and Combination
  3. CS | 02 | Computer Organization and Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Multiprocessors
  4. CS | 03 | Data Structures and Algorithm: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Complexity Theory, Advanced Algorithms
  5. CS | 04 | Problem Solving through C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. CS | 05 | Object Oriented Techniques: Object Oriented Technology, Java
  7. CS | 06 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Unix OS
  8. CS | 07 | Database Management Systems: 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, Database Security & Authorization, Query Processing & Optimization, File Organization & Indexing
  9. CS | 08 | 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
  10. CS | 09 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  11. CS | 10 | Internet Technology, Web Design and Web Technology: Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, JavaScript-Basics, HTML Basics
  12. CS | 11 | System Analysis And Design: Fundamentals of Systems and Information Systems, SDLC and Development Approaches, Software Documentation and Software Requirements Specification (SRS), SDD and Quality Assurance, Security, Risk Management & Maintenance
  13. CS | 12 | Information Security and Cyber Laws: 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
  14. CS | 13 | Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing
  15. GS Paper | 01 | Indian and World Geography: Geography
  16. GS Paper | 02 | History: History
  17. GS Paper | 03 | Indian Economy & Social Development: Indian Economy
  18. GS Paper | 04 | General Science: Biology, Chemistry, Physics
  19. GS Paper | 05 | Elementary Maths: Number System, Divisibility Rules, HCF LCM, Percentage, Profit and Loss, Simple Interest and Compound Interest, Ratio and Proportion (Ratios), Average, Time and Work, Speed Time and Distance, Algebra, Mensuration and Geometry, Data Interpretation, Arithmetic, Statistics, Probability, Sequence and Series (Series), Mixture and Alligation, Calculus, Trigonometry, Vectors
  20. GS Paper | 06 | Indian Polity and Governance: Polity
  21. GS Paper | 07 | Current Events: GK- Current Affairs
  22. UPLT Live Classes Notes: UPLT Live Classes
  23. UPLT Full Mock Tests Tier 1:
  24. UPLT Full Mock Tests Tier 2:
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…