Toggle Main Menu Toggle Search

ePrints

Parallel Algorithms for Reduction of a General Matrix to Upper Hessenberg form on a Shared Memory Multiprocessor

Lookup NU author(s): Dr Kenneth Wright

Downloads


Abstract

This report is concerned with parallel algorithms for the orthogonal reduction of a general matrix to upper Hessenberg form. A variety of algorithms are investigated, which involve varying amounts of overlap between different parts of the calculation. Empirical comparison was carried out using C++ and the THREADS package on a shared memory Encore Multimax multiprocessor. In this testing the final version which involves most overlap was found to be the most efficient algorithm, and its efficiency is very high. The algorithms illustrate the advantages of parallel algorithms using dynamic allocation of tasks to THREADS on this shared memory machine.


Publication metadata

Author(s): Kaya D, Wright K

Publication type: Report

Series Title: Department of Computing Science Technical Report Series

Year: 1994

Pages: 26

Source Publication Date: October 1994

Report Number: 490

Institution: Department of Computing Science, University of Newcastle upon Tyne

Place Published: Newcastle upon Tyne

URL: http://www.cs.ncl.ac.uk/publications/trs/papers/490.pdf


Share