Banker's Algorithm

• Multiple instances.
• Each process must a priori claim maximum use.
• When a process requests a resource it may have to wait.  
• When a process gets all its resources it must return them in a finite amount of time.