Priority Scheduling Advantage Vs Disadvantage

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/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. Paper-2 | Programming & Data Structures: 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
  3. Paper-2 | Databases / DBMS & SQL: 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
  4. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  5. Paper-2 | Computer Networks & Security: 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 Access Technologies, Network Security
  6. Paper-2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Number Systems and Codes, Minimization of Boolean Functions, Timing, Hazards and Testing, Logic Families, Combinational Logic Design, Arithmetic Circuits, Waveform Generators and Timer Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Sequential Circuits and State Machines, Latches and Flip-Flops, Finite State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Registers and Counters, Latches and Flip-Flops, Number Systems and Codes
  7. Paper-2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  8. Paper-2 | Theory of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines
  9. Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
  10. 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
  11. Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
  12. Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning), Alphabet and Word Tests, Numerical Reasoning, Number System, Averages, Mixtures and Alligation, Percentages, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Mathematical Operations, Data Sufficiency, Direction Sense, Assembling and Grouping of Shapes, Transformation of Shapes, Three-Dimensional Patterns and Visualization, Cubes and Dice, Vocabulary, Statistics, Algebra, Geometry, Permutations and Combinations, Logical Deduction and Induction, Syllogisms and Venn Diagrams, Critical Reasoning, Order, Ranking and Sequence, Reading Comprehension, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Profit, Loss and Discount, Constraint Puzzles, Clocks and Calendars, Traverse Surveying, Simplification and Approximation, Blood Relations, Data Interpretation, Venn Diagram
  13. Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra, Ratio and Proportion, Subject-Verb Agreement, Sentence Completion, Powers, Surds and Logarithms, Data Interpretation, Sequences and Series, Trigonometry, Mensuration, Measurement and Quantity Take-Off, Signal Space and Optimum Detection, Time and Work, Probability, Algebra, Speed, Time and Distance, Statistics, Sequence and Series (Series), Combinatorics
  14. Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Structure and Correction, Modals, Conditionals and Subjunctive, Tenses, Adjectives and Adverbs, Sentence Basics, Nouns and Pronouns, Voice and Reported Speech, Articles and Determiners, Vocabulary
  15. Coal India Previous Year Paper:
  16. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
  17. Coal India 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…