Skip to main content


eCommons@Cornell

eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1813/6580
Title: A Parallel Ordering for the Block Jacobi Method on a Hypercube Architecture
Authors: Bischof, Christian H.
Keywords: computer science
technical report
Issue Date: Mar-1986
Publisher: Cornell University
Citation: http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR86-740
Abstract: Jacobi methods for computing the singular value decomposition are ideally suited for multiprocessor environments since they contain a great deal of inherent parallelism. We give a parallel ordering for the block Jacobi Method that allows us to take full advantage of the nearest-neighbor topology of the hypercube. It is based on recursively embedding smaller rings into the hypercube using a Gray code labelling of processor nodes. This scheme is optimal in that it entails the lowest communication overhead possible.
URI: http://hdl.handle.net/1813/6580
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
86-740.pdf926.45 kBAdobe PDFView/Open
86-740.ps327.28 kBPostscriptView/Open

Refworks Export

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

 

© 2014 Cornell University Library Contact Us