Process Scheduling & Policies

Duration: 20 min

This video lesson is available to enrolled students.

Return to /learn/IBPS-SO-IT-MAINS/operating-system/linux-os/process-scheduling/asset-process-scheduling-policies after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. English Language: Vocabulary, Noun, Adjectives, Tenses, Pronoun, Adverb, Preposition, Conjunction, Active Passive Voice (Voice), Articles, Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage)
  3. Quantitative Aptitude & Numerical Ability: Ratio and Proportion (Ratios), Data Interpretation, Mixture and Alligation, Permutation and Combination, Number System, Sequence and Series (Series), Speed Time and Distance, Algebra, Speed Mathematics and Basic Mathematics, Percentage, Average, Time and Work, Simple Interest and Compound Interest, Profit and Loss, Age Problems, Partnership, Mensuration and Geometry, Probability, IBPS Specific Videos
  4. Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Puzzle Solving (Puzzles), Seating Arrangements, Blood Relations, Syllogisms, Inequality, Directions (Direction Test), Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Clock, Calendar, Analytical Reasoning (Counting Figures Reasoning), Selection Decision Table (Decision Making), Cubes & Dices, Machine Input-Output
  5. Data Structures- Professional Knowledge: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  6. Algorithms- Professional Knowledge: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  7. Python- Professional Knowledge: Python for Placements by Yash Sir, Collections & Strings, Functions & Modules, File Handling & Data Analysis, Python Basics
  8. Operating System- Professional Knowledge: Introduction to OS, Process Management, Process Synchronization, CPU Scheduling, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Windows OS
  9. DBMS + SQL- Professional Knowledge: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), File Organization & Indexing, SQL, Transaction Management, Concurrency Control, Relational Algebra, Relational Calculus, NoSQL, Data Warehousing & Mining
  10. Computer Networks- Professional Knowledge: Introduction to CN, Data Communication, Net Layer: IP Addressing, Net Layer: IPv4 & Proto, Application Layer, Hardware basics, Network Security, Transport Layer Services, DLL: Flow Control, Cloud Computing
  11. Software Engineering- Professional Knowledge: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  12. Computer Organization & Microprocessor- Professional Knowledge: Basics of COA, Cache Memory Organization, Programming the Basic Computer, Instr Formats & Modes
  13. Digital Logic Design- Professional Knowledge: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  14. Theory of Computation- Professional Knowledge: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Regular Language Properties, Pushdown Automata & CFG, Turing Machines
  15. Compiler Design- Professional Knowledge: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Intermediate Code Gen, Code Optimization
  16. Programming Languages- Professional Knowledge: C Programming by Yash Sir, Language Design, DMA, Macros, Scoping & File Handling, Object Oriented Programming (OOPS), Programming in C++, Java, HTML, C Language Core
  17. Emerging Tech- Professional Knowledge: Emerging Tech Trends, MS Office Applications
  18. Artificial Intelligence: Artificial Intelligence
  19. Image Processing: Digital Image Fundamentals
  20. Internet & Web Technology: Website, Browser & Services, Internet Fundamentals, Server Side & Security, 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, Cyber Safety and Security, Ethical Hacking
  21. Descriptive Paper: English Writing Ability
  22. Mains - Unit Tests:
  23. Mains - Full Mock Tests:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture introduces Linux process scheduling, beginning with preemptive scheduling and time sharing before comparing the three main policies: SCHED_NORMAL (CFS/EEVDF), SCHED_FIFO, and SCHED_RR. It concludes by transitioning to process creation using the fork() system call.

Chapters

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

    The lecture opens with a slide titled 'Preemptive Scheduling, Time Sharing & Priority.' The instructor explains that Linux uses preemptive scheduling, meaning a running process can be temporarily interrupted by the scheduler. A numbered diagram illustrates this: step 1 shows 'P1 Running,' followed by red text stating 'Time slice expires / higher priority process arrives.' Step 2 shows the 'Scheduler' is triggered to make a new decision, and step 3 shows 'P2 Running.' The instructor uses a red pen to circle key terms like 'P1 Running' and underline the trigger conditions, emphasizing that this mechanism improves system responsiveness and multitasking.

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

    The lesson transitions to a new slide titled 'Time Sharing.' The instructor explains that CPU time is divided among multiple processes, with each process getting a small time interval called a 'time slice.' A Gantt chart visualizes this by showing the CPU switching between Process 1 (P1), Process 2 (P2), and Process 3 (P3) over increasing time intervals from T1 to T5. The instructor underlines key phrases such as 'small time interval' and 'After its time slice, the scheduler may switch the CPU to another process.' A color-coded legend distinguishes between the different processes, and a 'Key Point' callout box summarizes how time sharing allows multiple tasks to appear to run simultaneously.

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

    The lecture moves to priority-based scheduling, defining how the scheduler considers the priority of processes while making decisions. The instructor highlights that in Linux, a lower 'nice value' is associated with higher scheduling priority for normal processes. The text on screen states: 'Higher scheduling priority -> Greater chance/preference for CPU time.' The instructor underlines important phrases like 'priority of processes' and 'nice value.' This section bridges the gap between basic time sharing and the specific Linux scheduling policies, establishing that priority is a core factor in CPU allocation.

  4. 10:00 – 15:00 10:00-15:00

    The instructor presents a comprehensive overview of Linux scheduling policies, comparing SCHED_NORMAL (CFS/EEVDF), SCHED_FIFO, and SCHED_RR. Step-by-step flow diagrams illustrate each policy. For SCHED_NORMAL, the diagram shows a 'Fair Scheduler (CFS / EEVDF)' that provides fair CPU sharing. For SCHED_FIFO, the flow shows 'Pick Highest Priority (First In, First Out)' and running until a higher priority process arrives. For SCHED_RR, the diagram shows processes 'Run for Time Quantum (tq)' and asks 'Time Quantum Expired?' to determine if the process is preempted. The instructor uses red annotations to highlight key differences in CPU time sharing and priority handling across the three columns.

  5. 15:00 – 19:42 15:00-19:42

    The lecture continues detailing the flows of SCHED_NORMAL, SCHED_FIFO, and SCHED_RR, emphasizing that FIFO uses strict priority-based scheduling without preemption within the same priority, while RR operates on a round-robin basis. The final section transitions to a new topic: 'Process Creation using fork().' A slide explains that fork() is a system call used to create a new process in Linux. A summary table breaks down the return values of fork(), stating that '> 0: Returned to Parent -> value is Child's PID.' This marks the end of the scheduling policies discussion and the beginning of process creation concepts.

The lecture systematically builds understanding of Linux scheduling from fundamental concepts to specific policies. It starts by defining preemptive scheduling and time sharing, using diagrams and Gantt charts to visualize how the CPU is shared among processes. It then introduces priority as a decision factor, specifically mentioning the Linux 'nice value.' The core of the lecture compares the three main scheduling policies (SCHED_NORMAL, SCHED_FIFO, SCHED_RR) using flowcharts to show their distinct logic for CPU allocation. Finally, it transitions to process creation via fork(), linking scheduling decisions back to how processes are initially created. The progression moves from 'what' (preemption/time sharing) to 'how' (policies/flows) to 'where it starts' (fork).

Loading lesson…