Performance modeling of multishift QR algorithms for the parallel solution of symmetric tridiagonal eigenvalue problems

Authors:
Takafumi Miyata;Yusaku Yamamoto;Shao-Liang Zhang
Affiliations:
Nagoya University, Nagoya, Aichi, Japan;Kobe University, Kobe, Hyogo, Japan;Nagoya University, Nagoya, Aichi, Japan
Venue:
ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II
Year:
2010

Citing 7
Cited 0

On a block implementation of Hessenberg multishift QR iteration

International Journal of High Speed Computing
Deferred shifting schemes for parallel QR methods

SIAM Journal on Matrix Analysis and Applications
A parallel QR algorithm for the symmetric tridiagonal eigenvalue problem

Journal of Parallel and Distributed Computing
Applied numerical linear algebra

Applied numerical linear algebra
A Hierarchical Approach for Performance Analysis of ScaLAPACK-Based Routines Using the Distributed Linear Algebra Machine

PARA '96 Proceedings of the Third International Workshop on Applied Parallel Computing, Industrial Computation and Optimization
Architecture of an automatically tuned linear algebra library

Parallel Computing
A parallel QR algorithm for symmetric tridiagonal matrices

IEEE Transactions on Computers - Special issue on parallel processors and processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Multishift QR algorithms are efficient for solving the symmetric tridiagonal eigenvalue problem on a parallel computer. In this paper, we focus on three variants of the multishift QR algorithm, namely, the conventional multishift QR algorithm, the deferred shift QR algorithm and the fully pipelined multishift QR algorithm, and construct performance models for them. Our models are designed for shared-memory parallel machines, and given the basic performance characteristics of the target machine and the problem size, predict the execution time of these algorithms. Experimental results show that our models can predict the relative performance of these algorithms to the accuracy of 10% in many cases. Thus our models are useful for choosing the best algorithm to solve a given problem in a specified computational environment, as well as for finding the best value of the performance parameters.