Deadlock Avoidance
Maximum requirements of each resource must be stated in advance by each process.
Two approaches:
- Do not start a process if its maximum requirement might lead to deadlock.
- Do not grant an incremental resource request if this allocation might lead to deadlock.
Two algorithms:
- One instance per resource type - Resource Allocation Graph algorithm.
- Multiple instances per resource type - The Banker’s algorithm.