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
키워드
graph theorydeadlock avoidancedirected graphresource optimizationPetri net
저자
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 ]
Corresponding Author
Wei Wu [ College of Information Science and Technology, Hainan University Haikou 570228, China ]
보안공학연구지원센터(IJUNESST) [Science & Engineering Research Support Center, Republic of Korea(IJUNESST)]
설립연도
2006
분야
공학>컴퓨터학
소개
1. 보안공학에 대한 각종 조사 및 연구
2. 보안공학에 대한 응용기술 연구 및 발표
3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최
4. 보안공학 기술의 상호 협조 및 정보교환
5. 보안공학에 관한 표준화 사업 및 규격의 제정
6. 보안공학에 관한 산학연 협동의 증진
7. 국제적 학술 교류 및 기술 협력
8. 보안공학에 관한 논문지 발간
9. 기타 본 회 목적 달성에 필요한 사업
간행물
간행물명
International Journal of u- and e- Service, Science and Technology
간기
격월간
pISSN
2005-4246
수록기간
2008~2016
십진분류
KDC 505DDC 605
이 권호 내 다른 논문 / International Journal of u- and e- Service, Science and Technology Vol.9 No.2