Show simple item record

dc.contributor.authorShiu, Pun Hangen_US
dc.date.accessioned2005-06-17T17:41:32Z
dc.date.available2005-06-17T17:41:32Z
dc.date.issued2002en_US
dc.identifier.urihttp://hdl.handle.net/1853/6550
dc.description.abstractThis report introduces a new theorem and its proof about the problem of deadlock 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 O[subscript hw](min(m,n)) in a parallel hardware implementation, where m, n are the number of processors and resources involved in deadlock detection respectively.en_US
dc.format.extent725319 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.publisherGeorgia Institute of Technologyen_US
dc.relation.ispartofseriesCC Technical Report; GIT-CC-02-46en_US
dc.subjectDeadlock detection
dc.subjectGraphs
dc.subjectMatrices
dc.subjectAlgorithms
dc.titleHardware/Software Deadlock Detection Algorithm and Implementationen_US
dc.typeTechnical Reporteng_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record