The banker’s algorithm is a resource allocation and deadlock avoidance algorithm that tests for safety by simulating the allocation for predetermined maximum possible amounts of all resources, then makes an “s-state” check to test for possible activities, before deciding whether allocation should be allowed to continue.
Here are important characteristics of banker's algorithm:
1. Keep many resources that satisfy the requirement of at least one client
2. Whenever a process gets all its resources, it needs to return them in a restricted period.
3. When a process requests a resource, it needs to wait
4. The system has a limited number of resources
5. Advance feature for max resource allocation