×

Feedback Queue in Operating System

In a computer or a laptop, there is a processor which do all the tasks. The processor cannot do all the tasks at a time. So, the tasks will be prioritized and scheduled according to it. This work will be done with the help of Feedback Queues. So, in this article, we are going to study briefly about the Feedback Queue. We will also see their advantages and disadvantages of it.

What is Feedback Queue?

The Feedback Queues was developed by Fernando J. Corbato. The Feedback Queue was introduced in the year 1962. For this, Fernando J. Corbato has received Turing award. The Feedback Queue usually works in multi levels, and they are also called as Multi level feedback Queue. The Feedback Queue works in a sequential order, and it must perform some specific steps. The Feedback Queue firstly divides the processes or tasks into many parts which will be divided as ready queues based on the requirement of processor. The Second step is to prioritize the divided processes or tasks. It gives the processes to the CPU which has high I/O bursts priority and this will be the last and final step of the steps in the Feedback Queue. In the Feedback Queue there will be a method called Round robin and this method will be used in scheduling a foreground queue. The Feedback queue also has another method called FCFS for scheduling the queues that are present in background.

Process of Feedback Queues

  • In the Feedback Queue the processes will run in multiple levels. The first process which starts to run will be considered as the first Queue.
  • The priority of the First Queue will not be altered when it is under process.
  • When the first queue does not finish its process in the given 4 units then the priority will be removed, and the next queue will be prioritized.
  • The queue should be processed in the given time slot otherwise next queue will be prioritized.
  • All the processes that are scheduled will be in the FCFS fashion.
  • The Lower priority queues only come into process when the highly prioritized Queues are empty.
  • The Lower priority queue which is in process will be stopped when the other priority queue is declared.

Advantages of Feedback Queue

There are many advantages in using the Feedback queues and the following are the some of the advantages of Feedback Queues.

  • The Feedback Queues are very flexible in terms of process scheduling and providing the time slots to the prioritized processes.
  • The Feedback Queues allows the processes to switch between the highly prioritized and lowly prioritized processes.
  • It helps in preventing the CPU or processor overloading.
  • In the Feedback Queue there is a mechanism called aging mechanism which helps in moving a lower priority activity to the next higher priority queue.
  • The Feedback Queues also allows the processes to switch in between the queues based on their burst time.

Disadvantages of Feedback Queue

As the Feedback Queues also have some advantages and below mentioned points are the disadvantages in using the Feedback Queues.

  • The Feedback Queues are very complex, and they are not easy to understand.
  • The Feedback Queues are one of the most challenging algorithms in the computer organization.
  • In the Feedback Queues all the methods should require having its own optimum scheduler.
  • When the Feedback queues are used the CPU overheads may be associated with this type of operations.
  • To select the best scheduler, it always depends on the other methods.

Need of using the Feedback queues

The Feedback queues are only used in the task scheduling of the processor. The Feedback queue has got a lot of advantages than any other task schedulers. The Feedback queue method is more adaptable than multilevel queue scheduling method. The Feedback queues have quick response time, and they carry operations like rescheduling a task within short period of time. The Feedback queue method primarily learns from the previous processes, and it also predicts the behavior of the upcoming task or a process. It helps in increasing the reaction time and reduces the time complexity of the process. The turnaround time of the process will also be decreased by using the Feedback queue.


Related Topics

Difference between Multi-programming and Multitasking

Difference between Multiprogramming and Multitasking         Multiprogramming  Multitasking In Multiprogramming, at the same time, we can run the multiple processes concurrently on one...

2 minutes read.

Operating System Services

The Operating System provides various types of services:   I/O operationProgram executionFile system manipulationCommunicationError HandlingResource allocationAccountingProtection 1. I/O Operation: - To execute a program, needs I/O, which consists of a file, or I/O device. Due to the protection...

3 minutes read.

Turn Variable or Strict Alternative Approach

Turn Variable or Strict Alternative Approach Turn Variable Approach is used for process synchronization mechanism, which offers synchronization between two processes. Turn variable is implemented on user mode, and it is a software mechanism. We...

3 minutes read.

Linux Operating System

What is Linux? The Linux operating system is used on various devices, including cellphones, automobiles, supercomputers, household gadgets, personal computers, and business servers. You can find Linux on your phones, thermostats, vehicles,...

8 minutes read.

Multiprogramming Operating System

You will discover more about the multiprogramming operating system in this post, including how it functions and its benefits and drawbacks. Each process needs several types of system time, including CPU...

4 minutes read.

Producer-Consumer Problem in OS

What is Producer-Consumer Problem? The Producer-Consumer problem is a classical problem. The Producer-Consumer problem is used for multi-process synchronization, which means synchronization between more than one processes. In this problem, we have one producer...

4 minutes read.

Segmentation in Operating System

The term segmentation in operating system refers to the division of computer memory into segments. Segmentation is a technique used by many modern operating systems to provide better memory management....

4 minutes read.

Strategies for Handling Deadlock

Strategies for Handling Deadlock The Strategies for handling Deadlock are: Deadlock IgnoranceDeadlock PreventionDeadlock AvoidanceDeadlock Detection and Recovery Deadlock Ignorance Deadlock Ignorance is the most popular deadlock handling strategy. We can use this in the various operating systems for...

2 minutes read.

Lock Variable Mechanism | Operating System

Lock Variable Mechanism The Lock variable mechanism is a synchronization mechanism that is implemented in a user mode. It is a software procedure. Lock variable is a solution for busy waiting that can be...

3 minutes read.

What is Thread and Types of Thread

What is Thread A thread means a lightweight process. Thread is the basic unit of CPU execution, which consists of thread ID, Program counter, set of registers to hold the information of current...

7 minutes read.

Process Scheduling in Operating System

Process Scheduling is an essential component of a Multiprogramming Operating System. So now let’s understand how it works by taking a real-life example. Suppose that you want to call someone...

6 minutes read.

Thrashing in Operating System

A virtual memory system's poor performance when the same pages are loaded repeatedly due to a lack of main memory to store them in secondary memory is referred to as...

3 minutes read.

Multi-user Operating Systems

Introduction Since only one user may interact with the computer at any given time, the operating system we use on our personal computers, laptops, tablets, and phones is sometimes referred to...

8 minutes read.

Deadlock Prevention in Operating System

Deadlock Prevention The conditions which we used for deadlock prevention are: Mutual ExclusionHold and WaitNo PreemptionCircular Wait 1. Mutual Exclusion: - From the resource point of view, the mutual exclusion means that simultaneously more...

4 minutes read.

Simple Structure in Operating System

An operating system is a piece of software that lets the user applications talk to the hardware of the system. Because it is such a complicated structure, the operating system...

3 minutes read.

Why is it critical for the Scheduler to distinguish between I/O-bound and CPU-bound programs

A CPU-bound process is one that spends most of its time executing instructions on the processor. A process that is I/O-bound spends most of its time waiting for input and...

2 minutes read.

Look Disk Scheduling

Look Disk Scheduling Look disk scheduling is another type of disk scheduling algorithm. Look scheduling is an enhanced version of SCAN disk scheduling. Look disk scheduling is the same as SCAN disk scheduling,...

4 minutes read.

Process State in OS

The Process passes from different states, from its formation to completion. The following are the states of the Process. NewReadyRunningBlock or WaitTerminated or CompletedSuspend readySuspend wait or suspend blocked 1. New: - The state in which a process...

2 minutes read.

Inter Process Communication in Operating System

Inter-Process Communication or IPC refers to the methods and techniques that allow processes (programs or tasks) to communicate with each other within a computer system. This is typically done through...

3 minutes read.

Difference between SCAN and FCFS Disk Scheduling Algorithm

SCAN / Elevator Algorithm A different form of disc scheduling method is the SCAN disc scheduling algorithm. We move the disc arm in a certain direction in this process (the direction...

3 minutes read.