What are the deadlock avoidance algorithms?

A dead lock avoidance algorithm dynamically examines the resource-allocation state to ensure that a circular wait condition can never exist. The resource allocation state is defined by the number of available and allocated resources, and the maximum demand of the process.There are two algorithms:

  1. Resource allocation graph algorithm

  2. Banker’s algorithm

a. Safety algorithm

b. Resource request algorithm