The multi-level communication: Efficient routing for interconnection networks
(2001) Journal of Supercomputing : an international journal of supercomputing design, analysis and use — Vol. 18, n° 2, p. 153-177 (2001)
Files
No attached file found for this publication.
Details
- Authors
- Abstract
- In this paper, we present a general methodology for the improvement of the criteria of a given routing scheme. We study particularly the correlation between deadlock-avoidance and paths' stretch factor [28]. We prove that the methodology preserves deadlock-avoidance. As the methodology starts from a primary communication scheme, we choose routing by Eulerian cycle rules [27] as the primary scheme. To validate the methodology, we apply the resulting routing scheme to the torus network. Then, making a judicious choice with regard to certain parameters, we prove that the result is an adaptive, deadlock-free, minimal and storage efficient routing algorithm for such networks.
- Affiliations
Citations
Hadim, M., & Sakho, I. (2001). The multi-level communication: Efficient routing for interconnection networks. Journal of Supercomputing : an international journal of supercomputing design, analysis and use, 18(2), 153-177. https://doi.org/10.1023/A:1008160800606 (Original work published 2001)