PPT Slide
Deadlock Prevention
4. Avoid circular wait: One technique is to prioritize resource usage by assigning a unique positive integer to a resource; a process can only request resources in numerically increasing order. Good solution, but can still lead to inefficient usage of resources.
Deadlock Avoidance
- Before a resource allocation is granted an algorithm is executed that pretends to perform the allocation and then detects cycles. A classic example is the Banker’s Algorithm (used by banks to make sure they have enough money to cover a loan, for instance).
- Unfortunately, execution of deadlock avoidance algorithms is computationally expensive (O(n2)).