http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Deadlock Avoidance Based on Graph Theory
Biyuan Yao,Jianhua Yin,Wei Wu 보안공학연구지원센터 2016 International Journal of u- and e- Service, Scienc Vol.9 No.2
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.
Path Optimization Algorithms Based on Graph Theory
Biyuan Yao,Jianhua Yin,Hui Zhou,Wei Wu 보안공학연구지원센터 2016 International Journal of Grid and Distributed Comp Vol.9 No.6
Transport with minimum time cost and distance remains to be an important research area in intelligent transport systems. Shortest path algorithms are primary methods to address simplified problems, which could not be well applied in high-dimensional real situations. We realized the minimum cost and maximum flow result via classical iterative algorithm based on graph theory, adjacency matrix is well applied to express the relationship between transport nodes, a topological sorting transport map is adopted to verify these approaches.