1/16
These flashcards cover key concepts and vocabulary related to deadlocks in operating systems, as presented in the lecture notes.
Name | Mastery | Learn | Test | Matching | Spaced |
---|
No study sessions yet.
Deadlock
A condition where two or more jobs are holding resources and waiting for the other resources, leading to a standstill.
Mutual Exclusion
A condition where resources cannot be shared and only one process can access it at a time.
Circular Wait
A situation where a set of processes are waiting for resources in such a way that they form a circular chain.
Banker's Algorithm
A resource allocation and deadlock avoidance algorithm that determines whether a system is in a safe state.
Safe State
A state in which there is a guaranteed sequence of processes that can complete without entering a deadlock.
Unsafe State
A state that may lead to deadlock if processes are executed in a particular order.
Starvation
A condition where a process is perpetually denied the resources it needs for execution.
Detection
The process of identifying the presence of deadlocks within the system.
Recovery
Methods used to restore the system to normal operation after a deadlock has been detected.
Resource Allocation Graph
A directed graph representing the allocation of resources to processes and vice versa.
Resource Holding
A situation where a process is holding resources while waiting to acquire additional resources.
No Preemption
Condition where resources cannot be forcibly taken away from processes holding them.
Modeling Deadlocks
Using directed graphs to visualize the allocation and requests of resources among processes to detect deadlocks.
Deadlock Prevention
Strategies designed to prevent the occurrence of one or more of the necessary conditions for deadlock.
Deadlock Avoidance
Strategies that dynamically avoid entering an unsafe state in resource allocation.
Resource Types Locked
Resources such as files and devices that can only be held exclusively by one job at a time.
Example of Starvation
Dijkstra's 'Dining Philosophers' problem where philosophers starve while waiting for forks.