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
Muitos pesquisadores têm usado redes de interconexão hipercubo por suas boas propriedades para construir muitos sistemas de processamento paralelo. Porém, à medida que o número de processadores aumenta, a probabilidade de ocorrência de nós defeituosos também aumenta. Conseqüentemente, para redes de interconexão de hipercubo que possuem nós defeituosos, vários algoritmos de roteamento dinâmico eficientes foram propostos, os quais permitem que cada nó retenha informações de status de seus nós vizinhos. Neste artigo, propomos uma versão melhorada do algoritmo proposto por Chiu e Wu, introduzindo a noção de acessibilidade total. Um nó totalmente alcançável é aquele que pode alcançar todos os nós não defeituosos que possuem distância de Hamming l do nó através de caminhos de comprimento l. Além disso, melhoramos ainda mais o algoritmo classificando as possibilidades de desvios em relação a cada distância de Hamming entre os nós atuais e alvo. Propomos um procedimento de inicialização que faz uso de uma condição equivalente para realizar esta classificação de forma eficiente. Além disso, realizamos uma simulação para medir o índice de melhoria e comparar nossos algoritmos com outros. Os resultados da simulação mostram que os algoritmos são eficazes quando aplicados a redes de interconexão de hipercubos de baixa dimensão.
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.
Copiar
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
Copiar
@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},}
Copiar
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 -