Dijkstra’s Banker’s algorithm in an operating system addresses which problem?

Concept

Deadlock-handling methods differ by when they act. Avoidance examines each proposed resource allocation and permits it only if the system can remain in a safe state.

A safe state is one for which at least one sequence exists in which every process can obtain its remaining resources and finish.

Application

The Banker’s algorithm uses the available resources, current allocations, and declared maximum demands to test a tentative request.

1. Compute each process’s remaining need from its maximum demand and current allocation.

2. Tentatively grant the request and update the available, allocation, and need values.

3. Run the safety test to check whether all processes can still finish in some safe sequence.

4. Grant the request only when that safe sequence exists; otherwise postpone it.

Contrast

• Deadlock recovery acts after a deadlock has occurred and may terminate processes, roll them back, or preempt resources.

• Mutual exclusion controls access to a critical section or non-shareable resource.

• Context switching transfers CPU execution by saving and restoring process or thread state.

Cross-check

Because the Banker’s algorithm refuses a request that would leave the system unsafe, it prevents entry into unsafe allocation states rather than recovering from an existing deadlock.

Therefore, the problem addressed is deadlock avoidance.