Parallel computation of the singular value decomposition on tree architectures
We describe three new Jacobi orderings for parallel computation of SVD problems on tree architectures. The first 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 efficiently on an ordinary binary tree. By combining these two orderings, an efficient new ordering, well suited for implementation on the Connection Machine CM5, is obtained.
|Collections||ANU Research Publications|
|1642-01.2003-07-09T06:24:58Z.xsh||356 B||EPrints MD5 Hash XML|
|TR-CS-93-05.pdf||182.97 kB||Adobe PDF|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.