Select the best term from the chapter that describes each definition.
a) A technique to periodically increase the priority of low-priority threads so that low-priority threads occasionally get run. The increase is temporary.
b) A situation that can occur in a priority thread scheduler where a low-priority thread never runs.
c) The condition where Thread 1 is waiting for a unique resource held by Thread 2, and Thread 2 is waiting for a unique resource held by Thread 1.
d) The condition where a thread is not allowed to run because it needs something that is unavailable.
e) The condition where once a thread blocks, there are a finite number of threads that will be allowed to proceed before this thread is allowed to proceed.
f) An operation that once started will run to completion without interruption
g) An implementation using a FIFO or mailbox that separates data input from data processing.
h) A technique that could be used to prevent the user from executing I/O on a driver until after the user calls the appropriate initialization.
i) A scheduling algorithm that assigns priority linearly related to how often a thread needs to run. Threads needing to run more often have a higher priority.
j) An OS feature that allows the user to run user-defined software at specific places within the OS. These programs are extra for the user's convenience and not required by the OS itself.
k) An OS feature that allows you to use the OS in safety-critical applications.
l) A scheduling algorithm with priority but varying time slice. If a thread blocks on I/O, its time slice is reduced. If it runs to completion of a time slice, its time slice is increased.
m) The condition where (at most) one thread is allowed access to a resource that can not be shared. If a second thread wishes access to the resource while the first thread is using it, the second thread is made to wait until the first thread is finished.
n) The condition a function has that allows it to be simultaneously executed by multiple threads.
o) A thread scheduling algorithm that has the threads themselves decide when the thread switches should occur.
p) A situation that can occur in a priority thread scheduler where a high-priority thread is waiting on a resource owned by a low-priority thread.
q) A type of semaphore implemented with a busy-wait loop.
r) A type of thread scheduler where each thread has equal priority and all threads are executed in a circular sequence.