Deadlocks - Αδιέξοδα. 3.1. Resource 3.2. Introduction to deadlocks 3.3. The ostrich algorithm 3.4. Deadlock detection and recovery 3.5. Deadlock avoidance 3.6. Deadlock prevention 3.7. Other issues. Chapter 3.
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Deadlocks - Αδιέξοδα
3.1. Resource
3.2. Introduction to deadlocks
3.3. The ostrich algorithm
3.4. Deadlock detection and recovery
3.5. Deadlock avoidance
3.6. Deadlock prevention
3.7. Other issues
Chapter 3
t
A B C
How deadlock occurs
How deadlock can be avoided
(o) (p) (q)
Strategies for dealing with Deadlocks
Data structures needed by deadlock detection algorithm
At all times: Σi=1Cij + Aj = Ej
n
An example for the deadlock detection algorithm
(3/2/1)
Demonstration that the state in (a) is safe – 10 instances
(a) (b) (c) (d) (e)
(a) (b) (c) (d)
(a) (b) (c)
Example of banker's algorithm with multiple resources
(a) (b)
Summary of approaches to deadlock prevention