Multi Level Feedback Queue Scheduling

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/ASRB-ICAR-T3-T4-INFORMATION-TECHNOLOGY-PRELIMS-MAINS/operating-system/cpu-scheduling/multilevel-queues/asset-multi-level-feedback-queue-scheduling after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Prelims: General Knowledge: Physics Chemistry Biology History Geography Polity Indian Economy Static General Knowledge GK- Current Affairs Environment
  2. Prelims: General English: Vocabulary Noun Pronoun Adjectives Preposition Articles Direct and Indirect Speech Tenses Conjunction Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Sentence Correction (Error Correction) Sentence Completion (Fill in the blanks) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Cloze Test (Cloze Passage) Verbal Analogy (Word Based Analogy) Sentence Construction Adverb Verb
  3. Prelims: Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) HCF LCM Divisibility Rules Average Sequence and Series (Series) Number System Powers and Exponents (Surds and Indices) Algebra Profit and Loss Simple Interest and Compound Interest Time and Work Pipe and Cistern Speed Time and Distance Mixture and Alligation Mensuration and Geometry Age Problems Partnership Statistics Data Interpretation Arithmetic
  4. Prelims: General Agriculture: Agriculture in India and Tripura Natural Resource Management Fundamentals of Crop Production Horticulture Crop Improvement Crop Protection Social Science
  5. IT Mains: Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management Distributed Systems
  6. IT Mains: Computer Networking: Introduction to CN 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
  7. IT Mains: DBMS: Basics of DBMS ER Diagram Relational Model & Functional Dependencies Keys & Integrity Constraints Normalization (1NF - BCNF) Decomposition Properties & 4NF Relational Algebra SQL Relational Calculus Transaction Management Concurrency Control Database Recovery Big Data Systems Database Security & Authorization Enhanced Data Models NoSQL
  8. IT Mains: Software Engineering: Fundamentals of Software Engineering Software Requirements and Quality Assurance Software Design, Estimation and Metrics Software Testing Software Maintenance and Configuration Management
  9. IT Mains: Data Structures & Algorithms: Introduction to DS Array Stack Queue Linked List Tree Graphs Hashing Algorithm Analysis Time Complexity Analysis Sorting Algorithms
  10. IT Mains: OOPS with C++ & Java: C Fundamentals OOPS with C++ Java Fundamentals Array, String, IO & References OOPS with Java Generic & Collections Multithreading File Handling & I/O
  11. IT Mains: Python: Introduction to Python Tokens, Variables, Data Types, I/O Operators & Expressions Control Flow & Looping Collections & Strings Functions & Modules
  12. IT Mains: Website Development: Website, Browser & Services Internet Fundamentals Web Design & Development Protocols & Services Web Publishing & Hosting Server Side & Security Emerging Technologies HTML Basics HTML5 CSS JavaScript-Basics .Net Programming PHP
  13. IT Mains: Mobile App Development: Mobile Computing Multimedia
  14. IT Mains: Linux / Windows Server Admin: Unix OS Linux OS
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video provides a detailed lecture on the Multi-level Feedback Queue Scheduling algorithm used in operating systems. The instructor begins by distinguishing this flexible approach from the rigid multilevel queue scheduling, where processes are permanently assigned to specific queues. He explains that the feedback mechanism allows processes to migrate between priority levels based on their CPU burst characteristics, ensuring that interactive and I/O-bound processes receive higher priority while CPU-bound processes are demoted. The lecture concludes with a specific numerical example illustrating time quanta and queue transitions.

Chapters

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

    The instructor introduces the topic using a slide titled Multi-level Feedback Queue Scheduling. He contrasts this with standard multilevel queues, noting on-screen text that says: Normally, when the multilevel queue scheduling algorithm is used, processes are permanently assigned to a queue when they enter the system. He explains that unlike this inflexible setup, the feedback queue allows processes to move between queues. The slide text further clarifies: The multilevel feedback queue scheduling algorithm, in contrast, allows a process to move between queues. He details that processes using too much CPU time are moved to lower-priority queues, whereas I/O-bound and interactive processes remain in higher-priority queues. He also mentions that a process waiting too long in a lower-priority queue may be moved to a higher-priority queue to prevent starvation, a concept known as aging.

  2. 2:00 – 3:48 02:00-03:48

    The lecture shifts to a concrete example with a diagram on the right side of the slide. The text reads: A process entering the ready queue is put in queue 0. A process in queue 0 is given a time quantum of 8 milliseconds. The instructor points to the diagram, which shows three stacked boxes labeled quantum = 8, quantum = 16, and FCFS. He explains that if a process does not finish within 8 milliseconds, it is moved to the tail of queue 1. If it still isn't complete after 16 milliseconds in queue 1, it is preempted and put into queue 2. He draws arrows on the screen to visualize this flow, emphasizing that processes needing more than 8 but less than 24 milliseconds are served quickly with lower priority, while long processes automatically sink to queue 2 and are served in FCFS order.

The video effectively bridges theory and practice. It starts by defining the core advantage of feedback queues—flexibility and starvation prevention—before grounding the concept in a specific algorithm with defined time quanta. This progression helps students understand both the why and the how of the scheduling mechanism.

Loading lesson…