Deadlock Avoidance
It's a method to evade deadlock by careful resource scheduling.
This approach to the deadlock problem foresees deadlock before it actually occurs. This approach uses an algorithm to access the possibility that deadlock could take place and acting accordingly.
If the essential conditions for a deadlock are in place, it is still possible to evade deadlock by being careful when resources are allocated. Possibly the most famous deadlock avoidance algorithm is the Banker's algorithm. Thus named for the reason that the process is analogous that used by a banker in deciding if a loan can be safely made.