Estimating Computer Performance for Parallel Sparse QR Factorisation

Author(s)
Miron, David J
Lenders, Patrick M
Publication Date
1999
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.
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
Link
Publisher
Springer
Series
Lecture Notes in Computer Science
Title
Estimating Computer Performance for Parallel Sparse QR Factorisation
Type of document
Conference Publication
Entity Type
Publication

Files:

NameSizeformatDescriptionLink