Local Diagnosability of k-ary n-cube Networks under the PMC Model
碩士 === 國立交通大學 === 資訊科學與工程研究所 === 94 === In this thesis, we introduce a new measure for diagnosability, called local diagnosability, by changing the original global viewpoint to a local viewpoint. With this new viewpoint, we yield an easy way to diagnose a multiprocessor system. We apply the concept...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2006
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/30741317396268419534 |
| Summary: | 碩士 === 國立交通大學 === 資訊科學與工程研究所 === 94 === In this thesis, we introduce a new measure for diagnosability, called local diagnosability, by changing the original global viewpoint to a local viewpoint. With this new viewpoint, we yield an easy way to diagnose a multiprocessor system. We apply the concept of local diagnosability to k-ary n-cube with no missing links and the local diagnosability of each node is exactly the degree of each node. Then we investigate the local diagnosability of k-ary n-cube with arbitrarily distributed missing links. Based on the result proved in this thesis, the number of missing links can be up to 2n−2 and the local diagnosability of each node is the remaining degree of each node. Moreover, we propose a more efficient diagnosis algorithm.
|
|---|