Operating System Scheduling Criteria Quiz

Starvation / Indefinite Blocking

Aging

Largely impacts performance

Resembles FCFS scheduling

In Multilevel Queue Scheduling, processes are permanently assigned to a queue and do not move, while in Multilevel Feedback Queue Scheduling, processes can move between queues based on their behavior.

In Time slice scheduling, each queue is allocated a certain amount of CPU time which it can divide among its processes. For example, 80% CPU time to foreground queue in Round Robin and 20% to background queue in FCFS.

Fixed priority scheduling involves serving all processes from one queue before moving to the next. For example, all foreground processes are served before any background processes.

SJF is non-preemptive, meaning once a process starts, it runs to completion. SRTF is preemptive, allowing a new process with a shorter burst time to run if it arrives.

Priority Scheduling selects the process to work on based on priority. The priority of a process can be determined by factors like deadline, memory requirements, or other criteria.

Round Robin Scheduling assigns a fixed time unit per process, called a time quantum. It aims to prevent starvation and provide fair allocation of CPU time to all processes.

HRRN Scheduling calculates the response ratio which is the ratio of (wait time + burst time) / burst time. It selects the process with the highest response ratio to execute next.