Circular Wait is when each process involved in the impasse is waiting for another to voluntarily release the resource so that at least one will be able to continue on.
According to the circular wait situation, a chain of processes exists in which each process is waiting for a resource that is being held by a different process. To avoid the cyclical wait situation, define a linear ordering of resource types (e.g. Directed Acyclic Graph). A process may only seek resources of types that come after R in the ordering if it has already been given resources of type R.
Numbering all resources and requiring that programs only request them in strictly increasing (or decreasing) order are two ways to eliminate the circular wait. In other words, before a process can request the resource Rj, all of the Ri must be released so that I >= j.
