Cpu Scheduling

__________ scheduling is the basis of multiprogrammed operating systems, allowing the CPU to switch among __________.

CPU, processes

The primary goal of multiprogramming is to maximize __________ utilization by ensuring that some process is always running.

CPU

The CPU scheduler selects a process from the __________ queue and allocates the CPU to it.

ready

A process execution consists of a cycle of __________ execution and __________ wait.

CPU, I/O

The histogram of CPU burst durations generally follows an __________ or __________ distribution.

exponential, hyperexponential

The two types of CPU scheduling are __________ scheduling, where processes voluntarily give up the CPU, and __________ scheduling, where processes can be forcibly removed.

nonpreemptive, preemptive

In preemptive scheduling, processes may be removed from the CPU if an __________ occurs or if a higher-priority process arrives.

interrupt

The __________ module gives control of the CPU to the process selected by the scheduler.

dispatcher

The time taken for the dispatcher to stop one process and start another is called __________ __________.

dispatch latency

The first-come, first-served (FCFS) scheduling algorithm uses a __________ queue.

FIFO

The __________ scheduling algorithm selects the process with the shortest CPU burst time next.

shortest-job-first (SJF)

Preemptive SJF scheduling is also known as __________ scheduling.

shortest-remaining-time-first

The __________ scheduling algorithm assigns each process a fixed time slice and cycles through them.

round-robin (RR)

A time slice in round-robin scheduling is also known as a __________ __________.

time quantum

The __________ scheduling algorithm assigns each process a priority value and executes the highest-priority process first.

priority

The problem of a low-priority process waiting indefinitely is known as __________.

starvation

The technique used to gradually increase a waiting process’s priority over time to prevent starvation is called __________.

aging

In __________ scheduling, processes are divided into distinct queues based on priority or process type.

multilevel queue

In __________ scheduling, processes can move between different priority queues based on their behavior.

multilevel feedback queue

The __________ __________ scope determines how user-level threads compete for CPU time within a single process.

process contention

The __________ __________ scope determines how kernel-level threads compete for CPU time across the entire system.

system contention

The two primary approaches to multiprocessor scheduling are __________ and __________ multiprocessing.

asymmetric, symmetric

In __________ multiprocessing, a single processor handles scheduling while others execute user processes.

asymmetric

In __________ multiprocessing, each processor schedules its own tasks independently.

symmetric

A __________ __________ occurs when a low-priority process holds a resource needed by a high-priority process.

priority inversion

The __________ __________ problem happens when a single CPU-bound process keeps the CPU, making I/O-bound processes wait.

convoy effect

The scheduling criterion that measures how long it takes for a process to start responding is called __________ __________.

response time

The scheduling criterion that measures how long a process takes from submission to completion is called __________ __________.

turnaround time

The scheduling criterion that counts the number of processes completed per unit time is called __________.

throughput

The scheduling criterion that measures the percentage of time the CPU is busy is called __________ __________.

CPU utilization

The scheduling criterion that measures the time a process spends in the ready queue is called __________ __________.

waiting time

A process that requires more CPU time than I/O time is considered __________-bound.

CPU

A process that requires more I/O time than CPU time is considered __________-bound.

I/O

A __________ lock is a synchronization mechanism that prevents multiple processes from executing critical sections simultaneously.

mutex

The method used to determine when a process moves between queues in multilevel feedback queue scheduling is called __________ __________.

scheduling policy

The __________ scheduling algorithm is considered optimal as it provides the minimum average waiting time.

shortest-job-first (SJF)

The __________ __________ is used in scheduling to estimate the next CPU burst based on previous burst times.

exponential average

The RR scheduling algorithm results in a high number of __________ __________ when the time quantum is too small.

context switches

The RR scheduling algorithm degenerates to __________ scheduling if the time quantum is too large.

FCFS

The __________ algorithm ensures that processes with higher priority preempt those with lower priority.

priority scheduling

The __________ scheduling algorithm is a hybrid approach that divides processes into queues based on different criteria.

multilevel queue

The __________ __________ scheduling algorithm prevents long-running processes from monopolizing CPU time by dynamically adjusting their priority.

multilevel feedback queue

A scheduling algorithm is considered __________ if it ensures that no process waits indefinitely.

fair

The time taken to save and restore process states during a context switch is called __________ __________.

context switch time

The __________ __________ effect occurs when short processes wait behind a long CPU-bound process in FCFS scheduling.

convoy effect

The __________ __________ policy ensures that processes are scheduled in the order they arrive.

first-come, first-served (FCFS)

In a multilevel queue scheduling system, the foreground queue often uses __________ scheduling, while the background queue uses __________ scheduling.

round-robin, FCFS

The two main types of thread scheduling are __________ scheduling and __________ scheduling.

process-contention, system-contention

In multilevel queue scheduling, each queue has its own __________ __________ for managing processes.

scheduling algorithm

A CPU scheduling algorithm should aim to maximize __________ and minimize __________.

CPU utilization, response time