Skip to main content
Article thumbnail
Location of Repository

The Principle Of Parallel Deadlock Detection

By Pun Hang Shiu and Vincent John Mooney III


This report introduces a new theorem and its proof about the problem of dead- lock detection. First, we examine how to represent the problem of deadlock with a directed graph. Then, translation from a directed graph into a matrix is elaborated. The theorem and its proof are based on this matrix representation. By applying this theorem, we present a novel parallel deadlock detection algorithm, which we hypothesize has a run-time complexity of Ohw (min(m,n)) in a parallel hardware implementation, where m, n are the number of processors and resources involved in deadlock detection respectively

Year: 2000
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.