Deadlock Avoidance Based on Graph Theory
| Autor: | Biyuan Yao, Wei Wu, Jianhua Yin |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
Wait-for graph
Theoretical computer science Computer Networks and Communications Computer science Edge chasing Graph theory 010103 numerical & computational mathematics 0102 computer and information sciences Directed graph Petri net 01 natural sciences 010201 computation theory & mathematics Graph (abstract data type) 0101 mathematics Deadlock prevention algorithms Software Moral graph |
| Zdroj: | International Journal of u- and e- Service, Science and Technology. 9:353-362 |
| ISSN: | 2005-4246 |
| DOI: | 10.14257/ijunesst.2016.9.2.34 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|