Bankers Algorithm Notes
Bankers Algorithm Notes
Definition:
It helps the system decide whether or not to grant resource requests by checking if
The algorithm is named after a banker who gives loans only if he is sure he can satisfy
Key Terms:
- Need: Remaining resources the process may still request (Need = Max - Allocation).
- A safe state means there's at least one sequence in which all processes can finish.
4. If the system is not safe -> deny the request and make the process wait.
3. If found:
- Finish[P] = true
- Repeat Step 2.
- Works Well with Fixed Resource Requests: Good when process needs are known in advance.
Limitations (optional):