MODULE 3
Process Synchronization and Deadlocks
Dr. Shreya Patankar
Process Synchronization and Deadlocks
❑ Concurrency: Principles of Concurrency,
❑ Inter-Process Communication, Process Synchronization
❑ Mutual Exclusion: Requirements Hardware Support(TSL),
❑ Operating System Support (Semaphores),
❑ Producer and Consumer problem
❑ Principles of Deadlock: Conditions and ResourceAllocation Graphs,
❑ Deadlock Prevention, Deadlock Avoidance: Banker’s Algorithm
❑ Deadlock Detection and Recovery,
❑ Dining Philosophers Problem
Principles of concurrency
Principles of concurrency
Principles of concurrency
Inter Process communication
Inter Process communication
Inter Process communication
Inter Process communication
Race condition
Race condition
The final balance is $30, but both withdrawals were approved, resulting in
an inconsistent state because the balance should never have dropped
below $0.
Process synchronization
Process synchronization
MUTUAL EXCLUSION
MUTUAL EXCLUSION
MUTUAL EXCLUSION
MUTUAL EXCLUSION- Interrupt
MUTUAL EXCLUSION- TSL
MUTUAL EXCLUSION-TSL
MUTUAL EXCLUSION-TSL
Process synchronization
Process synchronization – Mutual Exclusion
Process synchronization – Semaphores
Process synchronization- Binary Semaphore
Process synchronization- Binary Semaphore
Process synchronization- Binary Semaphore
Process synchronization- Counting Semaphore
Process synchronization- Counting Semaphore
Process synchronization- Counting Semaphore
Process synchronization- Counting Semaphore
Producer Consumer Problem
Producer Consumer Problem
Producer Consumer Problem
Producer Consumer Problem
Producer Consumer Problem
Problems in Producer Consumer Problem
Problems in Producer Consumer Problem
Readers Writers Problem
Readers Writers Problem
Readers Writers Problem
Readers Writers Problem
Readers Writers Problem
Readers Writers Problem
Deadlock
Necessary conditions for Deadlock
Deadlock
Deadlock
Deadlock Prevention
Deadlock Prevention
Deadlock Avoidance- RAG
Deadlock Avoidance- RAG
Deadlock Avoidance- RAG
Deadlock Avoidance- RAG
Deadlock Avoidance- RAG
Deadlock Avoidance- Bankers Algorithm
Deadlock Avoidance- Bankers Algorithm
Deadlock Avoidance- Bankers Algorithm
Deadlock Avoidance- Bankers Algorithm
Deadlock Avoidance- Bankers Algorithm
Deadlock Avoidance- Bankers Algorithm
Deadlock Avoidance-
Bankers Algorithm
Deadlock Avoidance-
Bankers Algorithm
Deadlock
Avoidance-
Bankers
Algorithm
Deadlock Detection
Deadlock Detection- wait for graph
Deadlock Detection- wait for graph
Resource Allocation Graph
Wait for Graph
Deadlock Detection- wait for graph
Resource Allocation Graph
Wait for Graph
Deadlock Detection
Deadlock Recovery
Dining Philosophers Problem
Dining Philosophers Problem
Dining Philosophers Problem
Dining Philosophers Problem
Dining Philosophers Problem
Question Bank
1 What are Principles of Concurrency
2 Explain IPC using shared memory and message passing with diagrams
3 What is Mutual Exclusion? What are necessary conditions for Mutual Exclusion?
4. Explain Test and Set lock Instructions for hardware support of Semaphores
5 Explain the working of Binary Semaphores
6. Explain the working of Counting Semaphores
7 Explain Producer-Consumer Problem with algorithm
8 Explain Dining Philosophers Problem with algorithm
9 What is deadlock? What are the necessary conditions for Deadlock
10 Explain the methods for deadlock Prevention
11 Explain RAG and Wait for Graph
12 Explain Bankers Algorithm.
13 Solve problems on Bankers Algorithm
14 Explain deadlock detection and recovery
15 Explain Dining philosophers problem with algorithm
