Distributed Processing and An Adaptive Wormhole Routing using Virtual Channels in K - ary n - cubes


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 4, No. 11, pp. 2732-2744, Nov. 1997
10.3745/KIPSTE.1997.4.11.2732,   PDF Download:

Abstract

This paper is based on multicasting model in k-ary n-cubes, and proposes an adaptive wormhole routing algorithm which allows faults and channel contention. The proposed algorithm only requires 2n virtual channels per physical channel which is proportional to the dimension n in order to allow (n-1) faults in a k-ary n-cube. This method uses smaller number of virtual channels than the previously proposed adaptive routing algorithms[5, 18]. Through a chaos simulator, we have measured message delay considering fault-tolerant as well as message traffic to our adaptive routing algorithm.


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]
L. S. Mok and K. C. Soo, "Distributed Processing and An Adaptive Wormhole Routing using Virtual Channels in K - ary n - cubes," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 4, no. 11, pp. 2732-2744, 1997. DOI: 10.3745/KIPSTE.1997.4.11.2732.

[ACM Style]
Lee Sung Mok and Kim Chang Soo. 1997. Distributed Processing and An Adaptive Wormhole Routing using Virtual Channels in K - ary n - cubes. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 4, 11, (1997), 2732-2744. DOI: 10.3745/KIPSTE.1997.4.11.2732.