Deadlock Avoidance

• Deadlock avoidance, allows the necessary conditions but makes sensible choices to ensure that a deadlock-free system remains free from deadlock
• With deadlock avoidance, a decision is made dynamically whether the current resource allocation request will, if granted, potentially lead to a deadlock
• Deadlock avoidance thus requires knowledge of future requests for process resources
• Ways to avoid deadlock by careful resource allocation:
  • Resource trajectories.
  • Safe/unsafe states.
  • Dijkstra's Banker's algorithm.