A Fast Distributed Deadlock-Detection Algorithm for Hypercube

Dilip Sarkar, Ratan Kumar Guha

Research output: Contribution to journalArticlepeer-review


There have been several distributed algorithms for deadlock detection. These algorithms are general and detect deadlocks for all topologies. In this paper, we have developed a fast distributed deadlock-detection algorithm for hypercube where a node waits for at most one message at a time. Non-waiting nodes participate in deadlock detection by assisting in signal passing. For analysis purpose, the algorithm is described for synchronous mode of computation. This algorithm terminates in 0(rr) time with overwhelming probability for a n-dimensional binary cube.

Original languageEnglish (US)
Pages (from-to)69-82
Number of pages14
JournalInternational Journal of Computer Mathematics
Issue number2
StatePublished - Jan 1 1988
Externally publishedYes


  • Algorithm
  • complexity analysis
  • deadlock
  • distributed algorithm
  • distributed system
  • parallel algorithm
  • synchronous parallel computation
  • tree contraction

ASJC Scopus subject areas

  • Computer Science Applications
  • Computational Theory and Mathematics
  • Applied Mathematics


Dive into the research topics of 'A Fast Distributed Deadlock-Detection Algorithm for Hypercube'. Together they form a unique fingerprint.

Cite this