Deadlock prevention algorithms

<p>In <a href="/facts/Computer_science/lN3pEyPz">computer science</a>, deadlock prevention algorithms are used in <a href="/facts/Concurrent_programming/yVzQBPr9">concurrent programming</a> when multiple processes must acquire more than one <a href="/facts/Shared_resource/tmLvfkwR">shared resource</a>.  If two or more concurrent processes obtain multiple resources indiscriminately, a situation can occur where each process has a resource needed by another process.  As a result, none of the processes can obtain all the resources it needs, so all processes are blocked from further execution.  This situation is called a <a href="/facts/Deadlock_(computer_science)/YDpdfnPP">deadlock</a>.  A deadlock prevention <a href="/facts/Algorithm/fnl5NmRt">algorithm</a> organizes resource usage by each process to ensure that at least one process is always able to get all the resources it needs. One such example of deadlock algorithm is <a href="/facts/Banker%2527s_algorithm/59Ps5YXI">Banker's algorithm</a>.
</p>

Deadlock prevention algorithms open-in-new

Deadlock prevention algorithms