×

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

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.

Page Table in Operating System

What is a Page Table? A page table is a data structure used by an operating system (OS) to store information about the physical location of the pages in a computer's...

6 minutes read.

Process Schedulers and Process Queue in OS

Process Schedulers There are various types of Process Schedulers: Long Term SchedulerShort Term SchedulerMedium Term Scheduler                                            Long Term Scheduler: - Long term scheduler is also referred to as Job Scheduler. The task of the Long-term...

3 minutes read.

Advantages of UNIX Operating System

What is UNIX OS? UNIX is a family of multitasking, multiuser operating systems that are used on a wide variety of computer platforms. It was developed in the late 1960s and...

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

Round-Robin Scheduling Algorithm in OS

Round-Robin is a Preemptive Scheduling Algorithm and is the most commonly used algorithm in CPU Scheduling.In this, each Process is assigned with a fix time interval to execute, which is...

5 minutes read.

5 Goals of Operating System

An Operating System (OS) is system software that acts as an interface or bridge between the hardware of a computer and the end user. Operating System reduces the communication barrier between the...

4 minutes read.

SJF Scheduling in OS

Shortest Job First (SJF) Scheduling in OS Shortest Job First is a Preemptive or Non-Preemptive algorithm. In the shortest job first algorithm, the job having shortest or less burst time will...

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

Distributed Shared Memory

Distributed Shared Memory is a process of managing memory over more than one node and makes inter-process communication which transfers to end users. It is a mechanism that allows user...

2 minutes read.

Bit Vector in Operating System

What is Bit vector? Bit vector is one of the most important methods used in the free space management of operating system. Free space management which is used by the operating...

3 minutes read.

N-Step-SCAN Disk Scheduling

Before you study about N-Step-SCAN Disk Scheduling, it requires prerequisite of what is Disk Scheduling Algorithms: Operating systems use disc scheduling to schedule I/O requests that arrive at the disc....

4 minutes read.

Functions of Operating System

The functions of Operating System are: Process Management Memory Management File Management Device Management Secondary storage Management Security Coordination between other software and users Networking Job Accounting Error detecting aids 1. Process Management Process Management support operating system to create and delete...

3 minutes read.

What is Deadlock in OS?

Deadlock in Operating System In an Operating System, a process uses various resources, and the resources are used in the following manner: Request the ResourceUse the ResourceRelease the Resource In the Operating System, Deadlock is a condition...

4 minutes read.

Operating System Properties

The Properties of Operating System are: Batch processingMultitaskingMulti-programmingInteractivityReal-Time SystemDistributed Environmentspooling 1. Batch Processing In Batch Processing, the OS first gathers the data and programs together in a batch, then processing starts. The operating system...

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

Priority Scheduling in OS

Priority Scheduling is a type of CPU Scheduling algorithm which is used for process scheduling. In Priority Scheduling, we assign some priorities to each process. The process which has higher priority among all...

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

Virtual Memory in Operating System

What is Virtual Memory Virtual Memory is a storage scheme in which the users have an illusion that users have a significant amount of Main Memory. We can perform this by taking a...

3 minutes read.

Need of Operating System

There are various needs of operating system: Managing Input-Output UnitThe Operating system as a platform for application programsMultitaskingConsistent user interface Managing Input-Output Unit: - With the help of the operating system, the...

2 minutes read.