Message Routing Algorithm on an Injured Hypercube


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 3, No. 2, pp. 242-250, Mar. 1996
10.3745/KIPSTE.1996.3.2.242,   PDF Download:

Abstract

Communications on hypercube nodes are done by done by explicit message routing. So efficient message routing is very important for the performance of hypercube multicomputers. However, hypercube nodes can be faulty due to hardware and/or software problems, which is called an injured hypercube. A reliable hypercube system should tolerate the problems. One of the methods to enhance reliability on injured hypercube is to use fault-tolerant message routing algorithms. In this paper, we propose a message routing algorithm with possible shortest distance using disjoint paths. To analyze the performance, the algorithm is simulated and evaluated.


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]
K. H. Taek and W. J. Woon, "Message Routing Algorithm on an Injured Hypercube," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 3, no. 2, pp. 242-250, 1996. DOI: 10.3745/KIPSTE.1996.3.2.242.

[ACM Style]
Kong Heon Taek and Woo Jin Woon. 1996. Message Routing Algorithm on an Injured Hypercube. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 3, 2, (1996), 242-250. DOI: 10.3745/KIPSTE.1996.3.2.242.