Global commutative and associative reduction operations in faulty SIMD hypercubes

We consider the problem of computing a global commutative and associative operation, also known as semi-group operation, (such as addition and multiplication) on a faulty hypercube. In particular, we study the problem of performing such an operation in an n-dimensional SIMD hypercube, Q/sub n/, with up to n-1 node and/or link faults. In an SIMD hypercube, during a communication step, nodes can exchange information with their neighbors only across a specific dimension. Given a set of at most n-1 faults, we develop an ordering d/sub 1/,d/sub 2/,...,d/sub 1/ of n dimensions, depending on where the faults are located. An important and useful property of this dimension ordering is the following: if the n-cube is partitioned into k-subcubes using the first k dimensions of this ordering, namely d/sub 1/, d/sub 2/,..., d/sub n/ for any 2/spl les/k/spl les/n, then each k-subcube in the partition contains at most k-1 faults. We use this result to develop algorithms for global sum. These algorithms use 3n-2, n+3 log n+3 log log n, and n+log n+d/sub 2/ log log n+O(log log log n) time steps, respectively.