Estimating Computer Performance for Parallel Sparse QR Factorisation

Title
Estimating Computer Performance for Parallel Sparse QR Factorisation
Publication Date
1999
Author(s)
Miron, David J
( author )
OrcID: https://orcid.org/0000-0003-2157-5439
Email: dmiron@une.edu.au
UNE Id une-id:dmiron
Lenders, Patrick M
Editor
Editor(s): P Amestoy, P Berger, M Dayde, I Duff, V Fraysse, L Giraud and D Ruiz
Type of document
Conference Publication
Language
en
Entity Type
Publication
Publisher
Springer
Place of publication
Berlin, Germany
Series
Lecture Notes in Computer Science
UNE publication id
une:1959.11/29662
Abstract
Performance estimates of a parallel computer during sparse matrix factorisation aid in the identification of overheads and the tuning of software. This paper proposes a technique which allows the computer parameters of computation speed, communication speed, latency and parallel efficiency to be estimated. The technique is based upon the use of mathematical models derived from a model problem in conjunction with experimental results. By combining the mathematical models with the experimental results, sets of simultaneous equations can be derived which can be solved for the above computer parameters. The technique is explained in the context of sparse QR factorisation.
Link
Citation
Euro-Par' 99 Parallel Processing: 5th International Euro-Par Conference Toulouse, France, August 31-September 3, 1999 Proceedings, p. 1049-1058
ISBN
9783540483113
9783540664437
Start page
1049
End page
1058

Files:

NameSizeformatDescriptionLink