Parallel implementation of QRD algorithms on the Fujitsu AP1000
Abstract
This report addresses several important aspects of parallel implementation of QR decomposition of a matrix on a distributed memory MIMD machine, the Fujitsu AP1000. They include: Among various QR decomposition algorithms, which one is most suitable for implementation on the AP1000? With the total number of cells given, what is the best aspect ratio of the array to achieve optimal performance? How efficient is the AP1000 in computing the QR decomposition of a matrix? To help answer these questions we have implemented various orthogonal factorisation algorithms on a 128-cell AP1000 located at the Australian National University. After extensive experiments some interesting results have been obtained and are presented in the report.
Description
Citation
Collections
Source
Book Title
Entity type
Access Statement
License Rights
DOI
Restricted until
Downloads
File
Description