Scheduling Criteria

Duration: 10 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/operating-system/cpu-scheduling/basics-criteria/asset-scheduling-criteria 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 provides a comprehensive overview of CPU scheduling criteria in Operating Systems, presented by Sanchit Jain from Knowledge Gate. The lecture begins by establishing that different scheduling algorithms possess unique properties that may favor specific classes of processes. Consequently, specific criteria are essential for the efficient selection of an algorithm. The instructor systematically defines and illustrates four key metrics: CPU utilization, throughput, waiting time, and response time. Using visual analogies such as a bank teller, a car assembly line, and queues of people, he clarifies abstract concepts. The session concludes by summarizing the primary goals of scheduling: maximizing utilization and throughput while minimizing turnaround, waiting, and response times. A crucial note is added that scheduling algorithms primarily affect waiting time in the ready queue rather than I/O execution time. The video serves as a foundational guide for understanding how operating systems manage process execution efficiently.

Chapters

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

    The video opens with a slide titled "Scheduling criteria". The text reads, "Different CPU-scheduling algorithms have different properties, and the choice of a particular algorithm may favour one class of processes over another." The instructor explains that because algorithms vary in their properties, selecting the right one requires considering specific criteria. He emphasizes that the choice of algorithm can inherently favor one type of process over another, making the selection process critical for system efficiency. He gestures with his hands to emphasize the different properties and the need for a structured approach to selection. The slide also mentions that "in order to efficiently select the scheduling algorithms following criteria should be taken into consideration".

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

    The first metric introduced is "CPU utilization". The slide text defines this as "Keeping the CPU as busy as possible." An image of a bank teller is displayed to provide a real-world analogy. The instructor explains that just as a bank teller should be kept busy serving customers to maximize efficiency, the CPU should be kept busy executing processes. He stresses that keeping the CPU busy is a fundamental goal of any scheduling algorithm to ensure hardware resources are not wasted. He points to the screen to draw attention to the text and the image. The visual of the bank teller helps students visualize the concept of resource utilization.

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

    The lecture moves to "Throughput", defined on the slide as "the number of processes that are completed per time unit". An image of a car assembly line illustrates this concept of continuous work completion. Next, "Waiting time" is defined as "the sum of the periods spent waiting in the ready queue." This is visualized with a photo of a long queue of people, highlighting the time spent waiting. Finally, "Response Time" is explained as "the time it takes to start responding, not the time it takes to output the response." An image of people waiting for food is used to show the moment service begins. The instructor clarifies that response time measures the delay until the first response, not the total task duration. He uses hand gestures to differentiate between starting and finishing. The visual of the food stall helps distinguish between response time and turnaround time.

  4. 10:00 – 10:17 10:00-10:17

    The video concludes with a summary slide containing a note. The text states, "The CPU-scheduling algorithm does not affect the amount of time during which a process executes I/O; it affects only the amount of time that a process spends waiting in the ready queue." The final point on the slide reads, "It is desirable to maximize CPU utilization and throughput and to minimize turnaround time, waiting time, and response time." The instructor reiterates these objectives, summarizing the trade-offs and goals of CPU scheduling. He underlines the key terms on the slide to emphasize their importance. The note clarifies the limitations of scheduling algorithms regarding I/O time.

The lecture effectively breaks down the complex topic of CPU scheduling into four measurable criteria. By using relatable analogies like bank tellers and assembly lines, the instructor makes abstract concepts like utilization and throughput concrete. The progression from system-centric metrics (utilization, throughput) to user-centric metrics (waiting time, response time) provides a logical flow. The final summary reinforces the dual goals of maximizing system efficiency and minimizing user wait times, while clarifying the specific scope of what scheduling algorithms can and cannot influence regarding I/O and execution time. This structured approach helps students understand the trade-offs involved in designing and selecting scheduling algorithms.

Loading lesson…