A Deadlock-Free Fault Tolerant Routing Method Using Partial-Adaptiveness in a N-Dimensional Meshed Network


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 6, No. 4, pp. 1090-1097, Apr. 1999
10.3745/KIPSTE.1999.6.4.1090,   PDF Download:

Abstract

The multicomputers operated in harsh environments should be designed to guarantee normal operations in the presence of the component faults. One solution for this is a fault-tolerant routing. In this paper, we consider n-dimensional meshed network for the basic topology and proposed a simple fault-tolerant routing algorithm that can transfer messages to their destination as desired in the presence of some component faults. The built algorithm basically adopts a WormHole(WH) routing method and uses the virtual channels sharing a physical channel for deadlock-freedom. Consequently, we show that the suggested algorithm has a higher performance than the X-Y routing algorithm through simulation results.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
M. D. Keun and K. H. Bae, "A Deadlock-Free Fault Tolerant Routing Method Using Partial-Adaptiveness in a N-Dimensional Meshed Network," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 6, no. 4, pp. 1090-1097, 1999. DOI: 10.3745/KIPSTE.1999.6.4.1090.

[ACM Style]
Moon Dae Keun and Kim Hag Bae. 1999. A Deadlock-Free Fault Tolerant Routing Method Using Partial-Adaptiveness in a N-Dimensional Meshed Network. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 6, 4, (1999), 1090-1097. DOI: 10.3745/KIPSTE.1999.6.4.1090.