×

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

Android Operating System

What is Android Operating System? Android is a Linux-based and open-source operating system mainly established for mobile devices like tablet computers and Smartphones. The Android operating system was established by the...

5 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.

Dining Philosophers Problem in Operating System

Edsger Wybe Dijkstra was a well-known Dutch scientist. He was the first person ever to present the Dining Philosophers Problem in the stream of Computer Science. The dining philosophers problem...

5 minutes read.

Resource Allocation Graph in Operating System

Resource Allocation Graph in OS We use the resource allocation graph for the pictographic representation of the state of a system. The resource allocation graph contains all the information related to the processes that...

5 minutes read.

Real-time Operating System

In this essay, we will thoroughly understand the real-time operating system. Real-Time Operating System: What do you mean? For any task to be completed, a real-time operating system (RTOS), a special-purpose operating...

5 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.

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.

Semaphore in Operating System

What is Semaphore in Operating System Semaphore is defined as an integer variable which is used to solve the problem of the critical section in process synchronization. In semaphore, we use...

3 minutes read.

Difference between Protection and Security in Operating System

Some operating system mechanisms facilitate us to stop tampering with logical and physical resources. Some of these methods are security and protection. Protection and security are distinct concepts, despite the...

3 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.

Operating System Tutorial

What is an Operating System? An Operating System is a System Software that handles the resources of a computer such as computer hardware and software and offers frequent services to the...

7 minutes read.

Ubuntu Operating System

Ubuntu Operating System Ubuntu is an open-source and a Linux based operating system. Ubuntu is developed for the Network Servers, Computers, and Smartphones. The Ubuntu operating system was developed by Canonical...

3 minutes read.

Process Management in OS

A Program will not do anything unless a CPU executes its instructions. An executing program is called a process. The Process requires computer resources to complete its task. More than...

3 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.

What is Demand Paging?

Demand Paging is defined as a process in which the pages are loaded into the memory (when the page fault occurs) or on-demand. It consists of the following steps: If there is...

4 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.

Swapping in Operating System

Swapping in operating systems refers to temporarily transferring a program or process from main memory to a secondary storage device, such as a hard drive or solid-state drive when there...

4 minutes read.

Difference between Seek Time and Disk Access Time in Disk Scheduling

Seek Time The time taken for the hard disk controller to detect a specific piece of recorded data is known as the seek time. The amount of time it takes to...

4 minutes read.

Can a Computer Run Without the Operating System

Computers may function right out of the box, mostly due to operating systems. Nowadays, there are probably already some pre-installed apps in a new computer when you buy one. Have...

9 minutes read.

Two Phase Locking Protocol

What is two phase locking? Two-phase locking is a concurrency control method in a database and transaction processing system. It ensures that transactions are executed in a serializable manner by requiring...

4 minutes read.