Deadlocks in Operating Systems

0.0(0)
studied byStudied by 0 people
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
Card Sorting

1/16

flashcard set

Earn XP

Description and Tags

These flashcards cover key concepts and vocabulary related to deadlocks in operating systems, as presented in the lecture notes.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

17 Terms

1
New cards

Deadlock

A condition where two or more jobs are holding resources and waiting for the other resources, leading to a standstill.

2
New cards

Mutual Exclusion

A condition where resources cannot be shared and only one process can access it at a time.

3
New cards

Circular Wait

A situation where a set of processes are waiting for resources in such a way that they form a circular chain.

4
New cards

Banker's Algorithm

A resource allocation and deadlock avoidance algorithm that determines whether a system is in a safe state.

5
New cards

Safe State

A state in which there is a guaranteed sequence of processes that can complete without entering a deadlock.

6
New cards

Unsafe State

A state that may lead to deadlock if processes are executed in a particular order.

7
New cards

Starvation

A condition where a process is perpetually denied the resources it needs for execution.

8
New cards

Detection

The process of identifying the presence of deadlocks within the system.

9
New cards

Recovery

Methods used to restore the system to normal operation after a deadlock has been detected.

10
New cards

Resource Allocation Graph

A directed graph representing the allocation of resources to processes and vice versa.

11
New cards

Resource Holding

A situation where a process is holding resources while waiting to acquire additional resources.

12
New cards

No Preemption

Condition where resources cannot be forcibly taken away from processes holding them.

13
New cards

Modeling Deadlocks

Using directed graphs to visualize the allocation and requests of resources among processes to detect deadlocks.

14
New cards

Deadlock Prevention

Strategies designed to prevent the occurrence of one or more of the necessary conditions for deadlock.

15
New cards

Deadlock Avoidance

Strategies that dynamically avoid entering an unsafe state in resource allocation.

16
New cards

Resource Types Locked

Resources such as files and devices that can only be held exclusively by one job at a time.

17
New cards

Example of Starvation

Dijkstra's 'Dining Philosophers' problem where philosophers starve while waiting for forks.