2023-09-06

Distributed Deadlock avoidance

• Deadlock avoidance in the context of distributed systems is not really feasible. Algorithms such as Banker_s algorithm have a complexity of $O(nnm)$
• In addition to the delays in the communication channels, this makes it really inefficient to implement an algorithm to avoid deadlocks.