Chap 9 - Short Answer

The simplest scheduling policy is __________ .

FCFS

The need to know or estimate required processing times for each process, the starvation of longer processes, and the lack of preemption are all difficulties with the __________ scheduling technique.

Shortest Process Next (SPN)

_________ is a scheduling policy in which the process with the shortest expected processing time is selected next, and if a shorter process becomes ready in the system, the currently running process is preempted.

Shortest Remaining Time (SRT)

The traditional UNIX scheduler, such as those used in SVR3 and 4.3 BSD UNIX systems, divides processes into fixed __________ of priority levels.

bands

A common technique for predicting a future value on the basis of a time series of past values is __________ .

exponential averaging

A scheduling mechanism that requires no prior knowledge of process length, yet can nevertheless favor shorter jobs, is known as the __________ scheduling mechanism.

feedback

The _________ scheduler determines which programs are admitted to the system for processing.

long term

__________ scheduling is part of the swapping function.

medium term

The __________ approach means that the operating system allocates the processor to a process and when the process blocks or is preempted, feeds it back into one of several priority queues.

multilevel feedback

Response time and throughput are examples of __________ criteria for short term scheduling.

performance related

The aim of __________ is to assign processes to be executed by the processor or processors over time, in a way that meets system objectives, such as response time, throughput, and processor efficiency.

processor scheduling

_________ is the elapsed time between the submission of a request until the response begins to appear as output.

response time

The __________ scheduler executes most frequently and makes the fine-grained decision of which process to execute next.

short term

Giving each process a slice of time before being preempted is a technique known as __________ .

time slicing

In terms of the queuing model, __________ is the total time that the item spends in the system (waiting time plus service time).

turnaround time