Prefix Computation on a Faulty Hypercube

The fundamental question addressed in this paper is that of computing the parallel prefix operation. In particular, we study the problem of performing such an operation in an n-dimensional SIMD hypercube, Q_n, with up to n-1 node faults. In an SIMD hypercube, during a communication step, nodes can exchange information with their neighbors only across a specific dimension. We exhibit an n+5 logn algorithm for this problem. The development of the algorithm is based on the existence of two so-called free dimensions in such a faulty hypercube [6].

[1]  Larry Rudolph,et al.  The power of parallel prefix , 1985, IEEE Transactions on Computers.

[2]  Hyoung Joong Kim,et al.  Partial Sum Problem Mapping Into a Hypercube , 1990, Inf. Process. Lett..

[3]  Bernd Becker,et al.  How robust is the n-cube? , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[4]  Ming-Syan Chen,et al.  Adaptive Fault-Tolerant Routing in Hypercube Multicomputers , 1990, IEEE Trans. Computers.

[5]  Suku Nair,et al.  Algorithm-Based Fault Tolerance on a Hypercube Multiprocessor , 1990, IEEE Trans. Computers.

[6]  José A. B. Fortes,et al.  A taxonomy of reconfiguration techniques for fault-tolerant processor arrays , 1990, Computer.

[7]  Selim G. Akl,et al.  Design and analysis of parallel algorithms , 1985 .

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

[9]  Arthur L. Liestman,et al.  A survey of gossiping and broadcasting in communication networks , 1988, Networks.

[10]  Sanjeev Saxena,et al.  On Parallel Prefix Computation , 1994, Parallel Process. Lett..

[11]  Cauligi S. Raghavendra,et al.  Free dimensions-an effective approach to achieving fault tolerance in hypercube , 1992, [1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing.

[12]  Dhiraj K. Pradhan.  Fault-Tolerant Multiprocessor Link and Bus Network Architectures , 1985, IEEE Transactions on Computers.

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

[14]  Richard Cole,et al.  Faster Optimal Parallel Prefix Sums and List Ranking , 2011, Inf. Comput..

[15]  Jehoshua Bruck,et al.  Running algorithms efficiently on faulty hypercubes , 1990, SPAA '90.