How to avoid deadlocks?

Question

When using multiple threads, shared memory needs to be locked by critical sections. However, using critical sections causes potential deadlocks. How can they be avoided?

Answer 1

THE FOLLOWING ALGORITHM IS USED TO AVOID DEADLOCK:

Banker’s Algorithm

–Impose less stringent conditions than in deadlock prevention in an attempt to get better resource utilization

–Safe state

•Operating system can guarantee that all current processes can complete their work within a finite time

–Unsafe state

•Does not imply that the system is deadlocked, but that the OS cannot guarantee that all current processes can complete their work within a finite time

–Requires that resources be allocated to processes only when the allocations result in safe states. –It has a number of weaknesses (such as requiring a fixed number of processes and resources) that prevent it from being implemented in real systems