Communications of the ACM - Special section on computer architecture
Discrete mathematics
Fault-Tolerant Routing in DeBruijn Comrnunication Networks
IEEE Transactions on Computers
Multigrid Algorithms on the Hypercube Multiprocessor
IEEE Transactions on Computers
Performance Analysis of Distributed Routing Strategies Free of Ping-Pong-Type Looping
IEEE Transactions on Computers
Processor allocation in an N-cube multiprocessor using gray codes
IEEE Transactions on Computers
IEEE Transactions on Computers
Topological Properties of Hypercubes
IEEE Transactions on Computers
Hyperswitch network for the hypercube computer
ISCA '88 Proceedings of the 15th Annual International Symposium on Computer architecture
Message routing in an injured hypercube
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Adaptive packet routing in a hypercube
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
On relaxed squashed embedding of graphs into a hypercube
SIAM Journal on Computing
Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
Minimal Order Loop-Free Routing Strategy
IEEE Transactions on Computers
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Depth-First Search Approach for Fault-Tolerant Routing in Hypercube Multicomputers
IEEE Transactions on Parallel and Distributed Systems
Distributed fault-tolerance for large multiprocessor systems
ISCA '80 Proceedings of the 7th annual symposium on Computer Architecture
An optimal fault-tolerant broadcasting algorithm for a hypercube multiprocessor
CSC '90 Proceedings of the 1990 ACM annual conference on Cooperation
Fault-Tolerant Routing in Mesh Architectures
IEEE Transactions on Parallel and Distributed Systems
A Family of Fault-Tolerant Routing Protocols for Direct Multiprocessor Networks
IEEE Transactions on Parallel and Distributed Systems
Adaptive Fault-Tolerant Deadlock-Free Routing in Meshes and Hypercubes
IEEE Transactions on Computers
Efficient Determination of Maximum Incomplete Subcubes in Hypercubes with Faults
IEEE Transactions on Computers
Compressionless Routing: A Framework for Adaptive and Fault-Tolerant Routing
IEEE Transactions on Parallel and Distributed Systems
Reliable Unicasting in Faulty Hypercubes Using Safety Levels
IEEE Transactions on Computers
A Theory of Fault-Tolerant Routing in Wormhole Networks
IEEE Transactions on Parallel and Distributed Systems
All-to-All Broadcasting in Faulty Hypercubes
IEEE Transactions on Computers
Use of Routing Capability for Fault-Tolerant Routing in Hypercube Multicomputers
IEEE Transactions on Computers
IEEE Transactions on Parallel and Distributed Systems
A Fully Adaptive Routing Algorithm for Dynamically Injured Hypercubes, Meshes, and Tori
IEEE Transactions on Parallel and Distributed Systems
Adaptive Fault-Tolerant Routing in Cube-Based Multicomputers Using Safety Vectors
IEEE Transactions on Parallel and Distributed Systems
A Testbed for Evaluation of Fault-Tolerant Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
Adaptive and Deadlock-Free Routing for Irregular Faulty Patterns in Mesh Multicomputers
IEEE Transactions on Parallel and Distributed Systems
Software-Based Rerouting for Fault-Tolerant Pipelined Communication
IEEE Transactions on Parallel and Distributed Systems
Probability vectors: a new fault-tolerant routing algorithm for k-ary n-cubes
Proceedings of the 2002 ACM symposium on Applied computing
Unsafety vectors: a new fault-tolerant routing for the binary n-cube
Journal of Systems Architecture: the EUROMICRO Journal
Modular Fault-Tolerant Boolean N-Cubes
IEEE Micro
Deadlock-Free Fault-Tolerant Routing in Injured Hypercubes
IEEE Transactions on Computers
A Coordinated Location Policy for Load Sharing in Hypercube-Connected Multicomputers
IEEE Transactions on Computers
A Fault-Tolerant Routing Strategy in Hypercube Multicomputers
IEEE Transactions on Computers
Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels
IEEE Transactions on Parallel and Distributed Systems
An Adaptive Fault-Tolerant Routing Algorithm for Hypercube Multicomputers
IEEE Transactions on Parallel and Distributed Systems
Strong Fault-Tolerance: Parallel Routing in Networks with Faults
ICCS '01 Proceedings of the International Conference on Computational Science-Part II
Performance analysis and fault tolerance of randomized routing on Clos networks
FRONTIERS '96 Proceedings of the 6th Symposium on the Frontiers of Massively Parallel Computation
Fault-tolerant adaptive routing for two-dimensional meshes
HPCA '95 Proceedings of the 1st IEEE Symposium on High-Performance Computer Architecture
A journey into multicomputer routing algorithms
PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
Fault-tolerance of Complete Josephus Cubes
Journal of Systems Architecture: the EUROMICRO Journal
Efficient fault-tolerant routing algorithm for OTIS-cube using unsafety vectors
Proceedings of the 2004 ACM symposium on Applied computing
Immunet: A Cheap and Robust Fault-Tolerant Packet Routing Mechanism
Proceedings of the 31st annual international symposium on Computer architecture
Fault-tolerant routing for complete Josephus cubes
Parallel Computing - Special issue: High-performance parallel bio-computing
IEEE Transactions on Parallel and Distributed Systems
Fault-Tolerant Routing Algorithms for a Massively Parallel Machine
ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 01
Routing to support communication in dependable networks
EUROMICRO-PDP'02 Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing
Broadcast in the locally k-subcube-connected hypercube networks with faulty tolerance
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
Mathematical and Computer Modelling: An International Journal
A depth-first search routing algorithm for star graphs and its performance evaluation
Mathematical and Computer Modelling: An International Journal
| Hi-index | 15.01 |
A connected hypercube with faulty links and/or nodes is called an injured hypercube. A distributed adaptive fault-tolerant routing scheme is proposed for an injured hypercube in which each node is required to know only the condition of its own links. Despite its simplicity, this scheme is shown to be capable of routing messages successfully in an injured n-dimensional hypercube as long as the number of faulty components is less than n. Moreover, it is proved that this scheme routes messages via shortest paths with a rather high probability, and the expected length of a resulting path is very close so that of a shortest path. Since the assumption that the number of faulty components is less than n in an n-dimensional hypercube might limit the usefulness of the above scheme, a routing scheme based on depth-first search which works in the presence of an arbitrary number of faulty components is introduced. Due to the insufficient information on faulty components, however, the paths chosen by this scheme may not always be the shortest. To guarantee all messages to be routed via shortest paths, the authors propose to equip every node with more information than that on its own links. The effects of this additional information on routing efficiency are analyzed, and the additional information to be kept at each node for the shortest path routing is determined. Several examples and remarks are given to illustrate the results.