Improved Deadlock Prevention Algorithms in Distributed Systems
Mahboobeh Abdoos · 2017
Distributed systems deadlock is similar to single-processor system deadlock, but is worse.It is harder to avoid, prevent or detect and is harder to cure, when it is tracked down because all the relevant information is scattered over many machines.In some systems, such as distributed database systems, it can be extremely serious, so it is important to understand how it differs from ordinary deadlock and what can be done about it.Two important deadlock prevention algorithms in distributed systems are wait-die and wound-wait.Their problem is that they just attend to the time stamp of processes, but not priority of them.In a real operating system, attending to priority of processes is very important.The proposed improved algorithms are attending to both priority and time stamp of processes.