Efficient detection and resolution of OR deadlocks in distributed systems

  • Authors:
  • Soojung Lee;Kil Hong Joo

  • Affiliations:
  • Department of Computer Education, Gyeongin National University of Education, Gyodae Street 45, Gyeyang-gu, Inchon 407-753, Republic of Korea;Department of Computer Education, Gyeongin National University of Education, Gyodae Street 45, Gyeyang-gu, Inchon 407-753, Republic of Korea

  • Venue:
  • Journal of Parallel and Distributed Computing
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper proposes a distributed algorithm for resolving deadlocks under the OR request model. The algorithm builds a distributed spanning tree by propagating probes. An encoding scheme is devised to deduce the ancestor-descendant relationship between tree nodes, so that the initiator of the algorithm collects only non-tree edge information to detect deadlock, whereas the current algorithms require all the edge information for deadlock detection. The proposed algorithm resolves all deadlocks reachable from the initiator. Its performance in terms of number of messages and execution time is better than or comparable to that of the existing algorithms. We further showed through analytic evaluation that the suggested algorithm substantially shortens deadlock detection time.