Issue No.10 - October (1999 vol.10)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.808130
<p><b>Abstract</b>—Fault-tolerant communication algorithms for <tmath>$k$</tmath>-ary <tmath>$n$</tmath>-cubes are introduced. These include: One-to-all broadcasting, all-to-all broadcasting, one-to-all personalized communication, and all-to-all personalized communication. Each of these algorithms can tolerate up to <tmath>$(2n-2)$</tmath> node failures provided that <tmath>$k > (2n-2)$</tmath> and <tmath>$k > 3$</tmath>. Extensions of these algorithms with up to <tmath>$2n-1$</tmath> node failures are also described. The communication complexities of the proposed algorithms are derived when wormhole or store and forward packet routing is used.</p>
Interconnection networks, torus, $k$-ary $n$-cubes, fault-free communication algorithms, fault-tolerant communication algorithms.
B.f.a. AlMohammad, "Fault-Tolerant Communication Algorithms in Toroidal Networks", IEEE Transactions on Parallel & Distributed Systems, vol.10, no. 10, pp. 976-983, October 1999, doi:10.1109/71.808130