Fault-tolerant routing based on approximate directed routable probabilities for hypercubes

Authors:
Thuy Dinh Duong;Keiichi Kaneko
Affiliations:
Department of Computer and Information Sciences, Tokyo University of Agriculture and Technology, Koganei-shi, Tokyo, Japan;Department of Computer and Information Sciences, Tokyo University of Agriculture and Technology, Koganei-shi, Tokyo, Japan
Venue:
ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part I
Year:
2011

Citing 5
Cited 0

The cosmic cube

Communications of the ACM - Special section on computer architecture
Use of Routing Capability for Fault-Tolerant Routing in Hypercube Multicomputers

IEEE Transactions on Computers
Adaptive Fault-Tolerant Routing in Cube-Based Multicomputers Using Safety Vectors

IEEE Transactions on Parallel and Distributed Systems
Fault-tolerant routing in hypercubes using probability vectors

Parallel Computing
A Fault-Tolerant Routing Strategy in Hypercube Multicomputers

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently, parallel processing systems have been studied very actively, and many topologies have been proposed. A hypercube is one of the most popular topologies for interconnection networks. In this paper, we propose two new fault-tolerant routing algorithms for hypercubes based on approximate directed routable probabilities. The probability represents ability of routing to any node at a specific distance and also taking account of from which direction the message was received. Each node chooses one of its neighbor nodes to send a message by comparing the approximate directed routable probabilities. We also conducted a computer experiment to verify the effectiveness of our algorithms.