Show simple item record

dc.contributor.authorLtaief, Hatem
dc.contributor.authorLuszczek, Piotr R.
dc.contributor.authorHaidar, Azzam
dc.contributor.authorDongarra, Jack
dc.date.accessioned2015-08-24T09:26:11Z
dc.date.available2015-08-24T09:26:11Z
dc.date.issued2012-01-01
dc.identifier.isbn9781614990406
dc.identifier.issn09275452
dc.identifier.doi10.3233/978-1-61499-041-3-397
dc.identifier.urihttp://hdl.handle.net/10754/575787
dc.description.abstractThis paper proposes an efficient implementation of the generalized symmetric eigenvalue problem on multicore architecture. Based on a four-stage approach and tile algorithms, the original problem is first transformed into a standard symmetric eigenvalue problem by computing the Cholesky factorization of the right hand side symmetric definite positive matrix (first stage), and applying the inverse of the freshly computed triangular Cholesky factors to the original dense symmetric matrix of the problem (second stage). Calculating the eigenpairs of the resulting problem is then equivalent to the eigenpairs of the original problem. The computation proceeds by reducing the updated dense symmetric matrix to symmetric band form (third stage). The band structure is further reduced by applying a bulge chasing procedure, which annihilates the extra off-diagonal entries using orthogonal transformations (fourth stage). More details on the third and fourth stage can be found in Haidar et al. [Accepted at SC'11, November 2011]. The eigenvalues are then calculated from the tridiagonal form using the standard LAPACK QR algorithm (i.e., DTSEQR routine), while the complex and challenging eigenvector computations will be addressed in a companion paper. The tasks from the various stages can concurrently run in an out-of-order fashion. The data dependencies are cautiously tracked by the dynamic runtime system environment QUARK, which ensures the dependencies are not violated for numerical correctness purposes. The obtained tile four-stage generalized symmetric eigenvalue solver significantly outperforms the state-of-the-art numerical libraries (up to 21-fold speed up against multithreaded LAPACK with optimized multithreaded MKL BLAS and up to 4-fold speed up against the corresponding routine from the commercial numerical software Intel MKL) on four sockets twelve cores AMD system with a 24000×24000 matrix size. © 2012 The authors and IOS Press. All rights reserved.
dc.subjectBulge Chasing
dc.subjectDynamic Scheduling for Multicore Systems
dc.subjectGeneralized Symmetric Eigenvalue Problem
dc.subjectTile Algorithms
dc.subjectTridiagonal Reduction
dc.titleSolving the generalized symmetric eigenvalue problem using tile algorithms on multicore architectures
dc.typeBook Chapter
dc.contributor.departmentKAUST Supercomputing Laboratory (KSL)
dc.contributor.departmentExtreme Computing Research Center
dc.identifier.journalAdvances in Parallel Computing
dc.contributor.institutionInnovative Computing Laboratory, University of Tennessee, Knoxville TN, United States
kaust.personLtaief, Hatem


This item appears in the following Collection(s)

Show simple item record