The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Ramai penyelidik telah menggunakan rangkaian interkoneksi hypercube untuk sifat baik mereka untuk membina banyak sistem pemprosesan selari. Walau bagaimanapun, apabila bilangan pemproses bertambah, kebarangkalian berlakunya nod yang rosak juga meningkat. Oleh itu, untuk rangkaian antara sambungan hypercube yang mempunyai nod yang rosak, beberapa algoritma penghalaan dinamik yang cekap telah dicadangkan yang membolehkan setiap nod menyimpan maklumat status nod jirannya. Dalam makalah ini, kami mencadangkan versi yang dipertingkatkan bagi algoritma yang dicadangkan oleh Chiu dan Wu dengan memperkenalkan tanggapan kebolehcapaian penuh. Nod boleh dicapai sepenuhnya ialah nod yang boleh mencapai semua nod tidak rosak yang mempunyai jarak Hamming l dari nod melalui laluan panjang l. Di samping itu, kami menambah baik lagi algoritma dengan mengklasifikasikan kemungkinan lencongan berkenaan dengan setiap jarak Hamming antara nod semasa dan sasaran. Kami mencadangkan prosedur permulaan yang menggunakan syarat yang setara untuk melaksanakan pengelasan ini dengan cekap. Selain itu, kami menjalankan simulasi untuk mengukur nisbah peningkatan dan membandingkan algoritma kami dengan yang lain. Keputusan simulasi menunjukkan bahawa algoritma adalah berkesan apabila ia digunakan pada rangkaian interkoneksi hypercube dimensi rendah.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Salinan
Keiichi KANEKO, Hideo ITO, "Fault-Tolerant Routing Algorithms for Hypercube Interconnection Networks" in IEICE TRANSACTIONS on Information,
vol. E84-D, no. 1, pp. 121-128, January 2001, doi: .
Abstract: Many researchers have used hypercube interconnection networks for their good properties to construct many parallel processing systems. However, as the number of processors increases, the probability of occurrences of faulty nodes also increases. Hence, for hypercube interconnection networks which have faulty nodes, several efficient dynamic routing algorithms have been proposed which allow each node to hold status information of its neighbor nodes. In this paper, we propose an improved version of the algorithm proposed by Chiu and Wu by introducing the notion of full reachability. A fully reachable node is a node that can reach all nonfaulty nodes which have Hamming distance l from the node via paths of length l. In addition, we further improve the algorithm by classifying the possibilities of detours with respect to each Hamming distance between current and target nodes. We propose an initialization procedure which makes use of an equivalent condition to perform this classification efficiently. Moreover, we conduct a simulation to measure the improvement ratio and to compare our algorithms with others. The simulation results show that the algorithms are effective when they are applied to low-dimensional hypercube interconnection networks.
URL: https://global.ieice.org/en_transactions/information/10.1587/e84-d_1_121/_p
Salinan
@ARTICLE{e84-d_1_121,
author={Keiichi KANEKO, Hideo ITO, },
journal={IEICE TRANSACTIONS on Information},
title={Fault-Tolerant Routing Algorithms for Hypercube Interconnection Networks},
year={2001},
volume={E84-D},
number={1},
pages={121-128},
abstract={Many researchers have used hypercube interconnection networks for their good properties to construct many parallel processing systems. However, as the number of processors increases, the probability of occurrences of faulty nodes also increases. Hence, for hypercube interconnection networks which have faulty nodes, several efficient dynamic routing algorithms have been proposed which allow each node to hold status information of its neighbor nodes. In this paper, we propose an improved version of the algorithm proposed by Chiu and Wu by introducing the notion of full reachability. A fully reachable node is a node that can reach all nonfaulty nodes which have Hamming distance l from the node via paths of length l. In addition, we further improve the algorithm by classifying the possibilities of detours with respect to each Hamming distance between current and target nodes. We propose an initialization procedure which makes use of an equivalent condition to perform this classification efficiently. Moreover, we conduct a simulation to measure the improvement ratio and to compare our algorithms with others. The simulation results show that the algorithms are effective when they are applied to low-dimensional hypercube interconnection networks.},
keywords={},
doi={},
ISSN={},
month={January},}
Salinan
TY - JOUR
TI - Fault-Tolerant Routing Algorithms for Hypercube Interconnection Networks
T2 - IEICE TRANSACTIONS on Information
SP - 121
EP - 128
AU - Keiichi KANEKO
AU - Hideo ITO
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E84-D
IS - 1
JA - IEICE TRANSACTIONS on Information
Y1 - January 2001
AB - Many researchers have used hypercube interconnection networks for their good properties to construct many parallel processing systems. However, as the number of processors increases, the probability of occurrences of faulty nodes also increases. Hence, for hypercube interconnection networks which have faulty nodes, several efficient dynamic routing algorithms have been proposed which allow each node to hold status information of its neighbor nodes. In this paper, we propose an improved version of the algorithm proposed by Chiu and Wu by introducing the notion of full reachability. A fully reachable node is a node that can reach all nonfaulty nodes which have Hamming distance l from the node via paths of length l. In addition, we further improve the algorithm by classifying the possibilities of detours with respect to each Hamming distance between current and target nodes. We propose an initialization procedure which makes use of an equivalent condition to perform this classification efficiently. Moreover, we conduct a simulation to measure the improvement ratio and to compare our algorithms with others. The simulation results show that the algorithms are effective when they are applied to low-dimensional hypercube interconnection networks.
ER -