원문정보
보안공학연구지원센터(IJUNESST)
International Journal of u- and e- Service, Science and Technology
Vol.9 No.2
2016.02
pp.353-362
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
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
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