| Summary: | 碩士 === 國立臺灣科技大學 === 工程技術研究所 === 82 === The major feature of crossed cubes is that its diameter is
almost only half of that of hypercube. Hence, it has the
better performance for using crossed cube than hypercube as
doing the communication intensive computation. This paper
presents a fully adaptive fault-tolerant routing algorithm for
crossed cubes. In order to achieve this goal, a concept of
partition distance is proposed and used to develop crossed
distance algorithm that can compute the distance between two
nodes by according to their node addressses. To compute all
shortest paths of any two nodes, three algorithms are designed.
One of them is used to develop a deadlock-free fully adaptive
fault-tolerant routing algorithm. The major results are as
follows. Longest shortest path of the fully adaptive fault-
tolerant routing algorithm is only ┌(n+3) and the minimal
number of faulty nodes that it formscubes is /2┐at least ┌(
n+2)/2┐. In addition, this algorithm only requires ┌(n+5)/4┐
virtual networks for avoiding deadlock.
|
|---|
