Parallel Computation of the Singular Value Decomposition on Tree Architectures

  • Published 1999
We describe three new Jacobi orderings for parallel computation of SVD problems on tree architectures. The rst ordering uses the high bandwidth of a perfect binary fat-tree to minimise global interprocessor communication costs. The second is a new ring ordering which may be implemented e ciently on an ordinary binary tree. By combining these two orderings… CONTINUE READING