Deadlock Avoidance
Impose some discipline on the way in which resources, i.e., semaphores, are accumulated by a process, so deadlock becomes impossible
Put all the resources in some numerical order and then require that any program always acquires resources in increasing numerical order
- Assume program needs resources i and j, with i > j
- Program will never try to acquire resource i if it is not already holding resource j