An improved, centralised algorithm for detection and resolution of distributed deadlock in the generalised model

Selvaraj, Srinivasan; Rajaram, R.

doi:10.1080/17445760.2011.629999

“…Different from Chen"s algorithm, the initiator in Lee"s algorithm [7] receives replies from leaf nodes only, and it needs less than 2e messages and only d + 2 time units. In the algorithm [1], the initiator performs reduction once it receives a reply and it terminates the execution when it detects and resolves a deadlock. This algorithm uses messages of length e+2n has a time complexity of d + 2 time units in worst case.…”

Section: Related Workmentioning

confidence: 99%

“…This paper proposes a method that will improve the performance of Srinivasan [1] distributed deadlock algorithm. In Srinivasan algorithm whenever multiple initiators invoke the algorithm one after the other same deadlock cycle and similar message transfers may be reported in more than one execution.…”

Section: Introductionmentioning

confidence: 99%

Untitled

2016

IOSRJEN

0

View full text Add to dashboard Cite

In a distributed system, a deadlock may occur when set of processes wait for resources from each other. A process involved in a deadlock waits indefinitely unless a special action is taken. Deadlock leaves the system into a blocking state with no process getting complete and also it reduces the throughput. In this paper a technique is presented that will improve the performance of Srinivasan distributed deadlock algorithm for multiple executions. In Srinivasan algorithm whenever multiple initiators invoke the algorithm one after the other same deadlock cycle and similar message transfers may be reported in more than one execution. So, in order to handle multiple executions an algorithm has been proposed which will not only reduce the number of message transfers but will also reduce the deadlock detection time. The proposed algorithm gives priority to different algorithm execution depending on their process id"s along with this it allows lower priority executions to continue so that a deadlock that are not directly reachable from the higher priority execution could be detected.

show abstract

“…A formal description of algorithm [1] executed at process "i" is given below. Data structure of a process 'i': (Initial values are inside the parenthesis).…”

Section: Algorithm Specificationmentioning

confidence: 99%

A Modified Algorithm for Distributed Deadlock Detection in Generalized Model

Surve¹,

Bhatt²

2016

IOSRJEN

1

0

View full text Add to dashboard Cite

In a distributed system, a deadlock may occur when set of processes wait for resources from each other. A process involved in a deadlock waits indefinitely unless a special action is taken. Deadlock leaves the system into a blocking state with no process getting complete and also it reduces the throughput. In this paper a technique is presented that will improve the performance of Srinivasan distributed deadlock algorithm for multiple executions. In Srinivasan algorithm whenever multiple initiators invoke the algorithm one after the other same deadlock cycle and similar message transfers may be reported in more than one execution. So, in order to handle multiple executions an algorithm has been proposed which will not only reduce the number of message transfers but will also reduce the deadlock detection time. The proposed algorithm gives priority to different algorithm execution depending on their process id"s along with this it allows lower priority executions to continue so that a deadlock that are not directly reachable from the higher priority execution could be detected.

show abstract