The connection machine
Communication effect basic linear algebra computations on hypercube architectures
Journal of Parallel and Distributed Computing
Solving problems on concurrent processors
Solving problems on concurrent processors
Information and Computation
Topological Properties of Hypercubes
IEEE Transactions on Computers
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
The iPSC/2 direct-connect communications technology
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Fast computation using faulty hypercubes
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
Analysis and Implementation of Branch-and-Bound Algorithms on a Hypercube Multicomputer
IEEE Transactions on Computers
Efficient histogramming on hypercube SIMD machines
Computer Vision, Graphics, and Image Processing
Hypercube algorithms: with applications to image processing and pattern recognition
Hypercube algorithms: with applications to image processing and pattern recognition
Optimal communication algorithms for hypercubes
Journal of Parallel and Distributed Computing
Parallel Recognition and Parsing on the Hypercube
IEEE Transactions on Computers
Tolerating Faults in Hypercubes Using Subcube Partitioning
IEEE Transactions on Computers - Special issue on fault-tolerant computing
Asymptotically Optimal Broadcasting and Gossiping in Faulty Hypercube Multicomputers
IEEE Transactions on Computers
Introduction to parallel computing: design and analysis of algorithms
Introduction to parallel computing: design and analysis of algorithms
Optimal Broadcast in All-Port Wormhole-Routed Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Efficient Mapping of ANNs on Hypercube Massively Parallel Machines
IEEE Transactions on Computers
Balanced Parallel Sort on Hypercube Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
On Some Global Operations in Faulty SIMD Hypercubes
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Total Exchange in Faulty SIMD Hypercubes
Proceedings of the 8th International Symposium on Parallel Processing
| Hi-index | 0.00 |
In this paper, we develop algorithms in order of efficiency for all-to-all broadcast problem in an N = 2n-node n-dimensional faulty SIMD hypercube, Qn, with up to n$-$ 1 node faults. The algorithms use a property of a certain ordering of dimensions. Our analysis includes startup time(驴) and transfer time(β). We have established the lower bound for such an algorithm to be n驴 + (2N$-$ 3)Lβ in a faulty hypercube with at most n$-$ 1 faults (each node has a value of L bytes). Our best algorithm requires 2n驴 + 2NLβ and is near-optimal. We develop an optimal algorithm for matrix multiplication in a faulty hypercube using all-to-all broadcast and compare the efficiency of all-to-all broadcast approach with broadcast approach and global sum approach for matrix multiplication. The algorithms are congestion-free and applicable in the context of available hypercube machines.