On the number of deadlock graphs
Joint Authors
Abu-Subayh, Muhammad Z.
Khayyat, Muhammad Ghazzali
Source
The Arabian Journal for Science and Engineering
Issue
Vol. 21, Issue 3 (31 Jul. 1996), pp.437-442, 6 p.
Publisher
King Fahd University of Petroleum and Minerals
Publication Date
1996-07-31
Country of Publication
Saudi Arabia
No. of Pages
6
Main Subjects
Abstract EN
The deadlock detection problem for serially-reusable, single-unit, single-request resources is equivalent to cycle detection in a bipartite graph.
A bipartite graph containing exactly one cycle represents a single deadlock.
There are many algorithms to detect a deadlock in this paper, we derive two formulas to determine the exact number of deadlock and non-deadlock graphs which are necessary to determine the complexity of a deadlock detection algorithm.
American Psychological Association (APA)
Abu-Subayh, Muhammad Z.& Khayyat, Muhammad Ghazzali. 1996. On the number of deadlock graphs. The Arabian Journal for Science and Engineering،Vol. 21, no. 3, pp.437-442.
https://search.emarefa.net/detail/BIM-559596
Modern Language Association (MLA)
Abu-Subayh, Muhammad Z.& Khayyat, Muhammad Ghazzali. On the number of deadlock graphs. The Arabian Journal for Science and Engineering Vol. 21, no. 3 (Jul. 1996), pp.437-442.
https://search.emarefa.net/detail/BIM-559596
American Medical Association (AMA)
Abu-Subayh, Muhammad Z.& Khayyat, Muhammad Ghazzali. On the number of deadlock graphs. The Arabian Journal for Science and Engineering. 1996. Vol. 21, no. 3, pp.437-442.
https://search.emarefa.net/detail/BIM-559596
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references : p. 442
Record ID
BIM-559596
