Exam 9: Uniprocessor Scheduling

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

__________ scheduling is part of the swapping function.

One problem with a pure priority scheduling scheme is that lower-priority processes may suffer starvation.

First-come-first-served (FCFS) is a simple scheduling policy that tends to favor I/O bound processes over processor bound processes.

The _________ determines which process, among ready processes, is selected next for execution.

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

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

FCFS performs much better for short processes than long ones.

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

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

In fair share scheduling each user is assigned a weighting of some sort that defines that user's share of system resources as a fraction of the total usage of those resources.

This is a decision whether to add a process to those that are at least partially in main memory and therefore available for execution:

The strategy that schedules processes based on their group affiliation is generally referred to as _________ .

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

The traditional UNIX scheduler employs multilevel feedback using round robin within each of the priority queues.

This is a decision whether to add a new process to the set of processes that are currently active:

The medium-term scheduler is invoked whenever an event occurs that may lead to the blocking of the current process or that may provide an opportunity to preempt a currently running process in favor of another.

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

In the case of the __________ policy, the scheduler always chooses the process that has the shortest expected remaining processing time.

The operating system must make _________ types of scheduling decisions with respect to the execution of processes.