%0 Journal Article %1 citeulike:7004475 %A Ni, Qinqin %A Sun, Weizhen %A Ma, Sen %C Los Alamitos, CA, USA %D 2009 %I IEEE Computer Society %J Information Assurance and Security, International Symposium on %K allocation, citas, citeulike deadlock, detetction, graph, resource %P 135--138 %R 10.1109/ias.2009.64 %T Deadlock Detection Based on Resource Allocation Graph %U http://dx.doi.org/10.1109/ias.2009.64 %V 2 %X Deadlock occurs randomly and is difficult to detect, it always has a negative impact on the effective execution of operating system. This paper uses the principle of adjacency matrix, path matrix and strongly-connected component of simple directed graph in graph theory, gives a model of detecting deadlock by exploring strongly-connected component from resource allocation graph. The experiment shows that it can detect resources and processes involved in deadlock effectively by this detection method. The paper provides a new idea for the research of operating system algorithms, and a new way for auxiliary teaching and practical engineering. %@ 978-0-7695-3744-3

@article{citeulike:7004475, abstract = {{Deadlock occurs randomly and is difficult to detect, it always has a negative impact on the effective execution of operating system. This paper uses the principle of adjacency matrix, path matrix and strongly-connected component of simple directed graph in graph theory, gives a model of detecting deadlock by exploring strongly-connected component from resource allocation graph. The experiment shows that it can detect resources and processes involved in deadlock effectively by this detection method. The paper provides a new idea for the research of operating system algorithms, and a new way for auxiliary teaching and practical engineering.}}, added-at = {2017-09-08T10:52:59.000+0200}, address = {Los Alamitos, CA, USA}, author = {Ni, Qinqin and Sun, Weizhen and Ma, Sen}, biburl = {https://www.bibsonomy.org/bibtex/26c7176aae1be05df790ad992a839e691/fernand0}, citeulike-article-id = {7004475}, citeulike-linkout-0 = {http://doi.ieeecomputersociety.org/10.1109/IAS.2009.64}, citeulike-linkout-1 = {http://dx.doi.org/10.1109/ias.2009.64}, doi = {10.1109/ias.2009.64}, interhash = {290fd09fbf92d43a9cd55a7e271fc36b}, intrahash = {6c7176aae1be05df790ad992a839e691}, isbn = {978-0-7695-3744-3}, journal = {Information Assurance and Security, International Symposium on}, keywords = {allocation, citas, citeulike deadlock, detetction, graph, resource}, pages = {135--138}, posted-at = {2010-04-12 12:10:52}, priority = {2}, publisher = {IEEE Computer Society}, timestamp = {2017-09-08T10:53:23.000+0200}, title = {{Deadlock Detection Based on Resource Allocation Graph}}, url = {http://dx.doi.org/10.1109/ias.2009.64}, volume = 2, year = 2009 }