Sample Test 3 Flashcards
A set of processes is _________ when each process in the set is blocked awaiting an event that can only be triggered by another blocked process in the set.
deadlocked
Examples of __________ include processors, I/O channels, main and secondary memory, devices, and data structures such as files, databases, and semaphores.
reusable resources
With _________ only one process may use a resource at a time and no process may access a resource unit that has been allocated to another process.
mutual exclusion
A closed chain of processes exists, such that each process holds at least one resource needed by the next process in the chain is the condition of __________ .
circular wait
Once the processes have progressed into the __________ , those processes will deadlock.
fatal region
The strategy of deadlock _________ is to design a system in such a way that the possibility of deadlock is excluded.
prevention
The _________ condition can be prevented by requiring that a process request all of its required resources at one time and blocking the process until all requests can be granted simultaneously.
hold and wait
The fastest form of interprocess communication provided in UNIX is __________ .
shared memory
The __________ condition can be prevented by defining a linear ordering of resource types.
circular wait
Requested resources are granted to processes whenever possible with _________ .
deadlock detection
One of the most significant contributions of UNIX to the development of operating systems is the _________ .
pipe
A __________ is a software mechanism that informs a process of the occurrence of asynchronous events.
signal
The most common technique used for protecting a critical section in Linux is the __________ .
spinlock
The _________ allows multiple threads to have simultaneous read-only access to an object protected by the lock.
readers/writer lock
The _________ is useful in sending a signal to a thread indicating that a particular event has occurred.
event object
_________ can be defined as the permanent blocking of a set of processes that either compete for system resources or communicate with each other.
Deadlock
A _________ resource is one that can be safely used by only one process at a time and is not depleted by that use.
reusable
A _________ resource is one that can be created and destroyed.
consumable
The _________ is a directed graph that depicts a state of the system of resources and processes, with each process and each resource represented by a node.
resource allocation graph
Three conditions of policy must be present for a deadlock to be possible: mutual exclusion, no preemption, and _________ .
hold and wait
Three general approaches exist for dealing with deadlock: prevent, avoid, and __________ .
detect
__________ allows the three necessary conditions but makes judicious choices to assure that the deadlock point is never reached.
Deadlock avoidance
The strategy of resource allocation denial is referred to as the ___________ .
banker’s algorithm
The _________ of the system reflects the current allocation of resources to processes.
state
