Memory hierarchy exploration for accelerating the parallel computation of SVDs
Neural, Parallel & Scientific Computations
Hi-index | 0.00 |
We describe a new Jacobi ordering for parallel computation of SVD problems. The ordering uses the high bandwidth of a perfect binary fat-tree to minimise global interprocessor communication costs. It can thus be implemented efficiently on fat-tree architectures.