Deadlock Detection Based on Resource Allocation Graph

2009 Fifth International Conference on Information Assurance and Security Pub Date : 2009-08-18 DOI:10.1109/IAS.2009.64

Qinqin Ni, Weizhen Sun, Sen Ma

引用次数: 14

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.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

基于资源分配图的死锁检测

死锁的发生是随机的，而且很难检测到，它总是对操作系统的有效执行产生负面影响。利用图论中简单有向图的邻接矩阵、路径矩阵和强连通分量的原理，给出了一种从资源分配图中挖掘强连通分量来检测死锁的模型。实验表明，该检测方法可以有效地检测出陷入死锁的资源和进程。本文为操作系统算法的研究提供了新的思路，为辅助教学和工程实践提供了新的途径。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

2009 Fifth International Conference on Information Assurance and Security

自引率

0.00%

发文量

期刊最新文献

A Joint Multiscale Algorithm with Auto-adapted Threshold for Image Denoising E-government Security Management: Key Factors and Countermeasure Security Threats and Countermeasures for Intra-vehicle Networks 2-Level-Wavelet-Based License Plate Edge Detection Proxy Re-encryption Scheme Based on SK Identity Based Encryption