Name
Abstract | ||
|---|---|---|
The k-ary n-cube is a popular interconnection network for many multiprocessor systems because of its good topological structure. In this paper, we investigated the relationship between the fault diagnosability of k-ary n-cube with missing edges and its minimum degree of vertices. Let G be a k-ary n-cube with missing edges and the minimum degree delta(G) = r. Then we show that the diagnosability of G is r for r >= 3, n >= 2 under the PMC model and BGM model.[GRAPHICS]. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1080/17445760.2019.1655741 | INTERNATIONAL JOURNAL OF PARALLEL EMERGENT AND DISTRIBUTED SYSTEMS |
Keywords | DocType | Volume |
Interconnection networks, diagnosability, fault tolerance, k-ary n-cubes | Journal | 35 |
Issue | ISSN | Citations |
1 | 1744-5760 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Liqiang Fan | 1 | 0 | 0.34 |
| Jun Yuan | 2 | 244 | 23.10 |