Deadlock prevention
To design a system in such a way that the possibility of a deadlock is excluded a priori.
Prevention philosophy: We know what the preconditions are; So prevent one or more these from occurring.
For example: Circular wait can be prevented by linear ordering of the resource types. If a process holds resources of type Rj , then it can request resources of type Rk, k > j, but not Ri where i <= j. Similarly, any other process holding Ri can request Rj but a process holding Rj cannot request Ri.