earticle

논문검색

Deadlock Avoidance Based on Graph Theory

초록

영어

Deadlock Avoidance remains to be a significant aspect of deadlock research. Modeling approaches based on Graph Theory provide effective strategy to solve this problem. We built avoidance model of directed graph and adjacent matrix via resource allocation graph, proposed three improved algorithm for deadlock avoidance and discussed the implementation of the program. The topology analyze of matrix storage information indicates entire optimization utilization results though certain key vertices and edges, this model verified by the banker’s algorithm and Petri net finally.

목차

Abstract
 1. Introduct
 2. Deadlock Model Based on Graph Theory
  2.1. Resource Allocation Graph
  2.2. Deadlock Criterion Based on Directed Graph
  2.3. Deadlock Avoidance Based on Directed Graph
 3. Modeling and Simulation
  3.1. Banker’s Algorithm
  3.2. Graph-theoretical Algorithm
  3.3. Petri Net
 4. Simulation Analysis and Conclusions
 5. Related Works
 References

저자정보

  • Biyuan Yao College of Information Science and Technology, Hainan University Haikou 570228, China
  • Jianhua Yin College of Information Science and Technology, Hainan University Haikou 570228, China
  • Wei Wu College of Information Science and Technology, Hainan University Haikou 570228, China

참고문헌

자료제공 : 네이버학술정보

    ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

    0개의 논문이 장바구니에 담겼습니다.