Many applications in computational science and engineering require the computation of eigenvalues and vectors of dense symmetric or Hermitian matrices. For example, in DFT (density functional theory) calculations on modern supercomputers 10% to 30% of the eigenvalues and eigenvectors of huge dense matrices have to be calculated. Therefore, performance and parallel scaling of the used eigensolvers is of upmost interest. In this article different routines of the linear algebra packages ScaLAPACK and Elemental for parallel solution of the symmetric eigenvalue problem are compared concerning their performance on the BlueGene/P supercomputer. Parameters for performance optimization are adjusted for the different data distribution methods used in the two libraries. It is found that for all test cases the new library Elemental which uses a two-dimensional element by element distribution of the matrices to the processors shows better performance than the old ScaLAPACK library which uses a block-cyclic distribution.
[1]
Robert A. van de Geijn,et al.
Elemental: A New Framework for Distributed Memory Dense Matrix Computations
,
2013,
TOMS.
[2]
Inderjit S. Dhillon,et al.
The design and implementation of the MRRR algorithm
,
2006,
TOMS.
[3]
Bernd Mohr,et al.
The Scalasca performance toolset architecture
,
2010,
Concurr. Comput. Pract. Exp..
[4]
Jack Dongarra,et al.
ScaLAPACK user's guide
,
1997
.
[5]
Jack Dongarra,et al.
ScaLAPACK Users' Guide
,
1987
.
[6]
J. Cuppen.
A divide and conquer method for the symmetric tridiagonal eigenproblem
,
1980
.