The performance of finding eigenvalues and eigenvectors of dense symmetric matrices on distributed memory computers
- Univ. of California, Berkeley, CA (United States)
We discuss timing and performance modeling of a routine to find all the eigenvalues and eigenvectors of a dense symmetric matrix on distributed memory computers. The routine, PDSYEVX, is part of the ScaLAPACK library. It is based on bisection and inverse iteration, but is not designed to guarantee orthogonality of eigenvectors in the presence of clustered eigenvalues. We use our validated performance model to conclude that PDSYEVX is very efficient for large enough problem sizes, nearly independently of input and output data layouts. However, efficiency will be low if interprocessor communication is too slow, such as on conventional workstation networks, or if per processor memory is too small, such as on the Intel Gamma. Modeling also helps us choose the appropriate algorithm to deal with clusters.
- OSTI ID:
- 125572
- Report Number(s):
- CONF-950212--; CNN: Grant CDA-8722788; Grant ASC 9005933; Grant DM28E04120; Grant DAAL003-91-C-0047
- Country of Publication:
- United States
- Language:
- English
Similar Records
A multiprocessor algorithm for the symmetric tridiagonal Eigenvalue problem
Toward an efficient parallel eigensolver for dense symmetric matrices