Priority Scheduling Advantage Vs Disadvantage

Duration: 6 min

This video lesson is available to enrolled students.

Inside: a video lesson and guided study material.

Module outline

About the Course: About the Course
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
Paper-1 & 2 | Data Interpretation: Data Interpretation
Paper-1 & 2 | General Mental Ability: Mental Ability, RSSB Specific Videos - Mental Ability
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
Paper-1 & 2 | Decision Making and Problem Solving: Selection Decision Table (Decision Making)
Paper-1 | General Science: Physics, Biology, Chemistry, RSSB Specific Videos
Paper-1 | General Awareness: State Wise GK, GK- Current Affairs
Paper-2 | Fundamentals of Computer: Basics of COA, Number System, Floating Point Rep, Number Representation
Paper - 2 | Digital Logic Systems: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits
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
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
Paper-2 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
Paper-2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
Paper 2 | Oops, C++, Java: Language Design, OOPS with C++, Java, .Net Programming, Java Fundamentals
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
Paper 2 | Emerging Trends and AI: Emerging Tech Trends, Artificial Intelligence
Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Advanced Algorithms
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
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
Paper-2 | Computer Organization and Architecture: Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations
Paper-2 | Web Development: JavaScript-Basics, HTML Basics, CSS, XML
Pedagogy: Child Development, Concept of Pedagogy, Psychology, Theories, Inclusive Education, Experiential Pedagogy, Curriculum Framework & Reforms, National Education Policy (NEP) 2020
Live Sessions: RSSB Live Sessions
RSSB Paper 1 - Full Mock Tests:
RSSB Paper 2 - Full Mock Tests:
SCI Previous Year Papers:

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

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: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.
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.