Banker's Algorithm (Deadlock Avoidance Deadlock avoidance)
Jump to navigation
Jump to search
Time Complexity
$O(mn^{2})$
Space Complexity
$O(mn)$ words
(Main space-consuming arrays needed include "Max," "Allocation," and "Need," which are all n*m arrays. Other arrays are either O(n) or O(m)-sized)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1966