Back to Search
Start Over
A General Fault-Tolerant Minimal Routing for Mesh Architectures.
- Source :
-
IEEE Transactions on Computers . Jul2017, Vol. 66 Issue 7, p1240-1246. 7p. - Publication Year :
- 2017
-
Abstract
- Fault-tolerant minimal routing algorithms aim at finding a Manhattan path between the source and destination nodes and route around all faulty nodes. Additionally, some non-faulty nodes that are helpless to make up of a fault-tolerant minimal path should also be routed around. How to label such non-faulty nodes efficiently is a major challenge. State-of-the-art solutions could not address it very well. We propose a path-counter method. It can label every node that are helpless to make up of a fault-tolerant minimal path with low time complexity. By counter the number of fault-tolerant minimal paths, it can: support arbitrary fault distribution, check the existence of fault-tolerant minimal paths, not sacrifice any available fault-tolerant minimal paths. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00189340
- Volume :
- 66
- Issue :
- 7
- Database :
- Academic Search Index
- Journal :
- IEEE Transactions on Computers
- Publication Type :
- Academic Journal
- Accession number :
- 123544228
- Full Text :
- https://doi.org/10.1109/TC.2017.2651828