Upgraded Deadlock Averting Algorithms in Distributed Systems

Distributed system deadlock is like ordinary deadlock but it is difficult to prevent or detect when it is traced down. In the distributed system all, the related information is distributed over many machines. However, deadlock in distributed systems is tremendously serious. Therefore, it is important to understand how this deadlock is different from the ordinary deadlock and how to prevent it. To prevent deadlock in the distributed system there are two techniques to prevent it one wound-wait and other is wait-die. Therefore, the problem in these algorithms are that they just attend to the timestamp of the process but not the priority of them but in the real operating system priority of the process is very important. In this paper, we present upgraded deadlock averting algorithms and these algorithms are deal with both priority and time stamp of processes