On some global operations in faulty SIMD hypercubes

Extends our prior results [Raghavendra & Sridhar (1992, 1993), Sengupta & Raghavendra (1994)] to obtain algorithms for performing all-to-all broadcast, global sum and broadcast operation in an N-node (N=2/sup n/), n-dimensional faulty SIMD hypercube, Q/sub n/ (n/spl ges/9), with the number of faults n-1<f/spl les/2n-3. We also discuss optimal algorithms for one-to-all personalized broadcasting and all-to-one personalized broadcasting in a Q/sub n/ with the number of faults f/spl les/n-1. Our broadcasting and global sum algorithms require 2n+19 steps and n+O(log n) steps, whereas the all-to-all broadcast algorithm requires 10N+15 steps.

[1]  Cauligi S. Raghavendra,et al.  Total exchange in faulty SIMD hypercubes , 1994, Proceedings of 8th International Parallel Processing Symposium.

[2]  Behrooz Parhami,et al.  Panel Assesses SIMD's Future , 1995 .

[3]  Cauligi S. Raghavendra,et al.  Broadcasting algorithms in faulty SIMD hypercubes , 1992, [1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing.

[4]  Parameswaran Ramanathan,et al.  Reliable Broadcast in Hypercube Multicomputers , 1988, IEEE Trans. Computers.

[5]  John P. Hayes,et al.  A Fault-Tolerant Communication Scheme for Hypercube Computers , 1992, IEEE Trans. Computers.

[6]  M. H. Schultz,et al.  Topological properties of hypercubes , 1988, IEEE Trans. Computers.

[7]  Frank Thomson Leighton,et al.  Fast computation using faulty hypercubes , 1989, STOC '89.

[8]  Jehoshua Bruck,et al.  Tolerating Faults in Hypercubes Using Subcube Partitioning , 1992, IEEE Trans. Computers.

[9]  Pierre Fraigniaud,et al.  Asymptotically Optimal Broadcasting and Gossiping in Faulty Hypercube Multicomputers , 1992, IEEE Trans. Computers.

[10]  Y. Chang Fault tolerant broadcasting in SIMD hypercubes , 1993, Proceedings of 1993 5th IEEE Symposium on Parallel and Distributed Processing.

[11]  S. Lennart Johnsson,et al.  Optimum Broadcasting and Personalized Communication in Hypercubes , 1989, IEEE Trans. Computers.

[12]  Cauligi S. Raghavendra,et al.  Global semigroup operations in faulty SIMD hypercubes , 1993, [1993] Proceedings Seventh International Parallel Processing Symposium.

[13]  John N. Tsitsiklis,et al.  Optimal Communication Algorithms for Hypercubes , 1991, J. Parallel Distributed Comput..

[14]  Ming-Yang Kao,et al.  Optimal Broadcast in All-Port Wormhole-Routed Hypercubes , 1994, ICPP.