FUNDAMENTALS OF COMPUTER

Detailed explanation-1: -Background processes take priority over foreground processes. The ready queue has been partitioned into seven different queues using the multilevel queue scheduling technique.

Detailed explanation-2: -In general, a multilevel feedback queue scheduler is defined by the following parameters: The number of queues. The scheduling algorithm for each queue which can be different from FIFO. The method used to determine when to promote a process to a higher priority queue.

Detailed explanation-3: -MLFQ (Multilevel Feedback Queue Scheduling) continuously analyses processes’ behavior (time of execution) and adjusts its priority accordingly. Assume that queues 1 and 2 use round robin with time quantum 4 and 8, respectively, while queue 3 uses FCFS. Also see, Multilevel Queue Scheduling.

Detailed explanation-4: -Priority scheduling is a non-preemptive algorithm and one of the most common scheduling algorithms in batch systems. Each process is assigned a priority. Process with highest priority is to be executed first and so on. Processes with same priority are executed on first come first served basis.