A study on performance analysis of multi-level feedback queue scheduling approach

Abstract

In CPU scheduling, various algorithms are used to schedule the processes. Few of them are First come first serve (FCFS), Shortest Job First (SJF), Shortest Remaining Time First (SRTF), Priority Scheduling, Round Robin (RR), Multi-Level Queue (MLQ), Multi-Level Feedback Queue (MLFQ) scheduling approaches. This scheduling is used to process the scheduling of operating systems, which is responsible for assigning the CPU time to available processes. To get user interactivity, throughput, real-time responsiveness, and more. The objective of the paper is to present an idea that keeps the CPU in maximum utilization until the process is requesting for an event. When the process is waiting for an event to occur, the CPU is switched between the processes for better utilization by consuming CPU cycles. The paper also addresses the four different approaches and their average waiting time in processing the jobs.