Operating Systems Chapter 5 - CPU Scheduling

A CPU scheduling approach involving multiple ready queues, each with its own scheduling algorithm and priority.

The core concept of multilevel queue scheduling involves scheduling based on process type or priority, placing processes in queues appropriate for their characteristics.

Processes can move between different queues in a multilevel feedback queue system, potentially benefiting from a change in priority or service.

When using multilevel queue scheduling, the operating system decides which queue a process should enter based on specific factors, like priority or resource requirements.

The selection of a process from the highest priority queue for execution is a fundamental aspect of multilevel queue scheduling with priority.

A CPU scheduling algorithm that utilizes multiple queues, each with its own scheduling policy and priority level. Processes can move between queues based on their characteristics, offering flexible resource allocation.

A technique used in multilevel feedback queue scheduling to adjust a process's priority based on its behavior. It typically involves raising a process's priority if it's waiting for a long time or lowering it if it's using excessive resources.

The number of separate ready queues used in a multilevel feedback queue scheduler.

The policies used to select and execute processes within each separate queue in a multilevel feedback queue scheduler.

The criteria used to determine when a process should be moved to a higher priority queue in a multilevel feedback queue scheduler.

The criteria used to determine when a process should be moved to a lower priority queue in a multilevel feedback queue scheduler.

The mechanism for assigning a newly arriving process to a specific queue in a multilevel feedback queue scheduler.

The criteria used to determine which specific queue a process should be assigned to when it requests service in a multilevel feedback queue scheduler.

A scheduling algorithm where the process with the shortest remaining burst time is executed next.

A scheduling algorithm where each process gets a fixed time slice (quantum) to run, and then it is moved to the back of the ready queue. If a process doesn't finish within its quantum, it is preempted.

A non-preemptive scheduling algorithm where processes are assigned priorities, and higher priority processes are executed before lower priority processes.

The total time a process spends waiting in the ready queue before it starts executing.

The total time a process takes from its arrival until it completes execution.

A graphical representation of the schedule and execution of processes, showing the timeline of each process.

The average waiting time calculated for all processes in a system.