Communications of the ACM - Special section on computer architecture
Multigrid Algorithms on the Hypercube Multiprocessor
IEEE Transactions on Computers
Vision algorithms for hypercube machines
Journal of Parallel and Distributed Computing
Processor allocation in an N-cube multiprocessor using gray codes
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
Iterative Algorithms for Solution of Large Sparse Systems of Linear Equations on Hypercubes
IEEE Transactions on Computers
Reliable Broadcast in Hypercube Multicomputers
IEEE Transactions on Computers
Task allocation onto a hypercube by recursive mincut bipartitioning
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
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
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
Routing and broadcasting in faulty hypercube computers
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
Addressing, Routing, and Broadcasting in Hexagonal Mesh Multiprocessors
IEEE Transactions on Computers
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Distributed fault-tolerance for large multiprocessor systems
ISCA '80 Proceedings of the 7th annual symposium on Computer Architecture
Adaptive Fault-Tolerant Routing in Hypercube Multicomputers
IEEE Transactions on Computers
Asymptotically Optimal Broadcasting and Gossiping in Faulty Hypercube Multicomputers
IEEE Transactions on Computers
Ariadne—an adaptive router for fault-tolerant multicomputers
ISCA '94 Proceedings of the 21st annual international symposium on Computer architecture
A Family of Fault-Tolerant Routing Protocols for Direct Multiprocessor Networks
IEEE Transactions on Parallel and Distributed Systems
Distributed, Deadlock-Free Routing in Faulty, Pipelined, Direct Interconnection Networks
IEEE Transactions on Computers
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
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
Dynamically Configurable Message Flow Control for Fault-Tolerant Routing
IEEE Transactions on Parallel and Distributed Systems
Unicast in Hypercubes with Large Number of Faulty Nodes
IEEE Transactions on Parallel and Distributed Systems
Fault-Tolerant Routing in Hypercube Multicomputers Using Local Safety Information
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
Locally Subcube-Connected Hypercube Networks: Theoretical Analysis and Experimental Results
IEEE Transactions on Computers
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
IEEE Transactions on Computers
Design and Evaluation of Hardware Strategies for Reconfiguring Hypercubes and Meshes Under Faults
IEEE Transactions on Computers
Safety Levels-An Efficient Mechanism for Achieving Reliable Broadcasting in Hypercubes
IEEE Transactions on Computers
Fault-Tolerant Wormhole Routing Algorithms for Mesh Networks
IEEE Transactions on Computers
Free Dimensions-An Effective Approach to Achieving Fault Tolerance in Hypercubes
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
Routing in Modular Fault-Tolerant Multiprocessor Systems
IEEE Transactions on Parallel and Distributed Systems
Implementation of Finite Lattices in VLSI for Fault-State Encoding in High-Speed Networks
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Methods for distributed unicast in hypercubes
Journal of Systems Architecture: the EUROMICRO Journal
A journey into multicomputer routing algorithms
PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
A Fault-Tolerant Adaptive and Minimal Routing Approach in n-D Meshes
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
A simple fault-tolerant adaptive and minimal routing approach in 3-D meshes
Journal of Computer Science and Technology
Fault-tolerance of Complete Josephus Cubes
Journal of Systems Architecture: the EUROMICRO Journal
Fault-tolerant routing for complete Josephus cubes
Parallel Computing - Special issue: High-performance parallel bio-computing
IEEE Transactions on Parallel and Distributed Systems
Performance Modelling and Analysis of Pipelined Circuit Switching in Hypercubes with Faults
HPCASIA '05 Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region
Fault-tolerant routing in hypercubes using partial path set-up
Future Generation Computer Systems - Systems performance analysis and evaluation
Extended minimal routing in 2-D meshes with faulty blocks
International Journal of High Performance Computing and Networking
A New Fault-Tolerant Routing Algorithm for m-ary n-cube Multi-computers and Its Performance Analysis
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007
A performance guaranteed new algorithm for fault-tolerant routing in folded cubes
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
A fault-tolerant routing strategy for fibonacci-class cubes
ACSAC'05 Proceedings of the 10th Asia-Pacific conference on Advances in Computer Systems Architecture
A depth-first search routing algorithm for star graphs and its performance evaluation
Mathematical and Computer Modelling: An International Journal
Hypercube connected rings: a scalable and fault-tolerant logical topology for optical networks
Computer Communications
| Hi-index | 0.04 |
Using depth-first search, the authors develop and analyze the performance of a routing scheme for hypercube multicomputers in the presence of an arbitrary number of faulty components. They derive an exact expression for the probability of routing messages byway of optimal paths (of length equal to the Hamming distance between the corresponding pair of nodes) from the source node to an obstructed node. The obstructed node is defined as the first node encountered by the message that finds no optimal path to the destination node. It is noted that the probability of routing messages over an optimal path between any two nodes is a special case of the present results and can be obtained by replacing the obstructed node with the destination node. Numerical examples are given to illustrate the results, and they show that, in the presence of component failures, depth-first search routing can route a message to its destination by means of an optimal path with a very high probability.