Scheduling Criteria
Duration: 10 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- 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
- Paper 2 | Computer Organization And Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Control Unit Design, Instr Formats & Modes, Programming the Basic Computer, Register Transfer and Microoperations
- Paper 2 | Analog And Digital Communication: Introduction to Communication Systems & Random Signals, Analog Communication Systems, Information Theory & Digital Communication Fundamentals, Amplitude Modulation, Communication Fundamentals and Bandpass Signals, Random Processes, Angle Modulation, Superheterodyne Receivers and Phase-Locked Loops, Noise in Communication Systems, Pulse Modulation and Pulse Code Modulation, Baseband Digital Transmission, Signal Space and Optimum Detection, Digital Modulation, Information Theory and Source Coding, Error Control Coding, Multiplexing and Multiple Access, Wireless, Satellite and Optical Communication Systems, Impedance Matching and Microwave Networks, Continuous-Time Fourier Transform, Radio Links and Propagation, Continuous-Time Fourier Series, System Properties and LTI Systems, Data Converters, Sampling and Reconstruction
- Paper 2 | Programming in C: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
- Paper 2 | Data Structures And Programming: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Java, OOPS with C++, Java Fundamentals, Array, String, IO & References, OOPS with Java, Generic & Collections, Object Oriented Technology
- Paper 2 | Algorithms: Algorithm Analysis, Sorting Algorithms, Time Complexity Analysis, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
- 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
- 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, Linux OS, Windows OS
- Paper 2 | Databases: 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 | Information Systems and 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 Networks: Introduction to CN, 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
- Paper 2 | Internet & Web Technologies: Website, Browser & Services, Web Design & Development, Web Publishing & Hosting, Server Side & Security, HTML Basics, JavaScript-Basics, CSS, XML, HTML5, Basics of Computer Graphics
- Paper 2 | Cyber Security And Emerging Technologies: Emerging Tech Trends, Internet of Things, Network Security, Security in Mobile and Wireless Computing, Cyber Safety and Security, Cyber Threats and Malware Attacks, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics
- Paper 2 | Cloud Technology: Cloud Computing
- Paper 2 | Probability and statistics: Probability, Statistics
- Paper-1 English: Vocabulary, Preposition, Articles, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Analogy and Classification, Prepositions and Conjunctions, Sentence Completion, Reading Comprehension, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Sentence Structure and Correction, Articles and Determiners, Narrative Sequencing, Subject-Verb Agreement, Modals, Conditionals and Subjunctive, Tenses, Adjectives and Adverbs, Vocabulary, Verb, Sentence Construction, Modals, Adverb
- Paper 1 General Mental Ability & Logical reasoning: Ratio and Proportion (Ratios), Data Interpretation, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Average, Powers and Exponents (Surds and Indices), Algebra, Profit and Loss, Simple Interest and Compound Interest, Mensuration and Geometry, Mental Ability, Arithmetic, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Venn Diagram, Analogy, Ratio and Proportion, Vocabulary, Averages, Mixtures and Alligation, Percentages, Geometry, Powers, Surds and Logarithms, Number System, Statistics, Three-Dimensional Patterns and Visualization, Permutations and Combinations, Alphabet and Word Tests, Sequences and Series, Trigonometry, Simplification and Approximation, Mathematical Operations, Constraint Puzzles, Numerical Reasoning, Series Completion, Patterns in Two-Dimensional Figures, Coding and Decoding, Direction Sense, Assembling and Grouping of Shapes, Cubes and Dice, Profit, Loss and Discount, Probability, Mensuration, Syllogisms and Venn Diagrams, Order, Ranking and Sequence, Logical Deduction and Induction, Clocks and Calendars, Time and Work, Algebra, Data Interpretation, Speed, Time and Distance, Data Sufficiency, Blood Relations, Combinatorics
- Paper-1 General Knowledge & Current Affairs: State Wise GK, History, Geography, GK- Current Affairs, Static General Knowledge
- Full Length 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
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: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.
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.
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.

