Skip navigation
Skip navigation

Parallel computation of the singular value decomposition on tree architectures

Zhou, B.B; Brent, Richard P


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.

CollectionsANU Research Publications
Date published: 1993
Type: Working/Technical Paper


File Description SizeFormat Image
TR-CS-93-05.pdf182.97 kBAdobe PDFThumbnail

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  23 August 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator