Deadlock Detection Based on Resource Allocation Graph

摘要：

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.

关键词： resource allocation graph deadlock detection strongly-coonected component

作者: Qinqin Ni Weizhen Sun Sen Ma

作者单位: College of Information Engineering Capital Normal University Beijing,China

会议类型: 国际会议

会议名称: The Fifth International Conference on Information Assurance and Security(第五届信息保障与安全国际会议)

会议地点: 西安

会议语种:英文

页码: 135-138

在线出版日期: 2009-08-18（万方平台首次上网日期，不代表论文的发表时间）