Exam 8: Understanding Processor Scheduling and Memory Management in Operating Systems

SPF scheduling might be desirable when ________ is the primary goal of the system.

When the quantum size is too ________, the overhead involved in ________ dominates and performance degrades.

The intense resource management that deadline scheduling requires often leads to increased ________ in those systems.

Fair share scheduling ensures ________.

In general, multilevel feedback queues push ________ processes to lower-level queues and ________ processes to higher-level queues, resulting in rapid response times to interactive requests.

Incorporating ________ when assigning priorities allows HRRN to avoid indefinite postponement, similar to aging in RR schemes.

Which of the following is not a performance criterion that a processor scheduler should attempt to satisfy.

In an operating system that supports threads, processor scheduling can be performed by ________.

When a user purchases priority, that user's process ______.

________ occurs when a low-priority process temporarily is assigned higher priority than a high-priority process.

FIFO scheduling ________.

The intermediate-level scheduler determines ___________.

Soft real-time scheduling ________.

A ________ priority system incurs less overhead than a ________ priority system but is less responsive to changing conditions in the system.

Deadline scheduling is most important in ________ systems.

On a system that does not support timeslicing, Java threads will run to completion in order unless they voluntarily relinquish control by calling the ________ method.

A system should provide good response times to a(n) ________ process, whereas a(n) ________ process generally can withstand reasonable delays.

SRT scheduling essentially incorporates ________ into SPF scheduling.

Under ________ scheduling, processes execute in the order the scheduler receives them.

The use of aging in a round-robin scheme helps to ________.