ICS 143 - Principles of Operating Systems. Lectures 8 and 9 - Deadlocks Prof. Nalini Venkatasubramanian firstname.lastname@example.org. Outline. System Model Deadlock Characterization Methods for handling deadlocks Deadlock Prevention Deadlock Avoidance Deadlock Detection Recovery from Deadlock
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.
Lectures 8 and 9 - Deadlocks
Prof. Nalini Venkatasubramanian
Typically, more than one process will be involved in a deadlock (the deadly embrace).
Process claims resource
Process requests resource
Process is assigned resource
Process releases resource
Need[i,j] = Max[i,j] - Allocation[i,j]
Available := Available - Request (i);
Allocation (i) := Allocation (i) + Request (i);
Need (i) := Need (i) - Request (i);
Algorithm requires an order of m (n^2) operations to detect whether the system is in a deadlocked state.
allowing the use of the optimal approach for each class of resources in the system.