Fault-Tolerant Routing Algorithms for a Massively Parallel Machine

Authors:
C. Aktouf;C. Robach;G. Mazare
Affiliations:
LGI-IMAG, France;LGI-IMAG, France;LGI-IMAG, France
Venue:
ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 01
Year:
1994

Citing 5
Cited 0

Deadlock-Free Message Routing in Multiprocessor Interconnection Networks

IEEE Transactions on Computers
Hypercube message routing in the presence of faults

C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Adaptive Fault-Tolerant Routing in Hypercube Multicomputers

IEEE Transactions on Computers
Overlay High-Density Interconnect: A Chips-First Multichip Module Technology

Computer
A Fault-Tolerant Communication Scheme for Hypercube Computers

IEEE Transactions on Computers

Quantified Score

Hi-index	0.04

Visualization

Abstract

This paper studies the reconfiguration problem within a 2D MIMD machine, once the testing process is accomplished. For that, three fault-tolerant routing algorithms are proposed and their efficiency illustrated. The implementation results are also given.