Overview

Many system processes require resources to fulfil tasks like for example accessing file storage, input/output devices and other resources to execute.

Once the execution is finished, the process releases the resource it was holding. However, when many processes run on a system they also compete for the resources they require for execution. This may cause a deadlock situation.

A deadlock is a situation in which more than one process is blocked because it is holding a resource and also requires some resource that is acquired by some other process. Therefore, none of the processes gets executed.

As you could guess: Deadlock prevention is a big and important topic, which is why there are many different approaches to prevention, reversal and elimination.

The program has 4 built-in algorithms to visually show you how they work against Deadlocks:

-Eliminate Hold And Wait ⌛

-Eliminate Circular Wait 🔃

-Eliminate No Preemption 🚦

-Bankier Algorithm 💸