umu.sePublikationer
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Parallel Algorithms and Library Software for the Generalized Eigenvalue Problem on Distributed Memory Computer Systems
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap. Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Högpresterande beräkningscentrum norr (HPC2N).ORCID-id: 0000-0001-5151-0965
2016 (Engelska)Licentiatavhandling, sammanläggning (Övrigt vetenskapligt)Alternativ titel
Parallella algoritmer och biblioteksprogramvara för det generaliserade egenvärdesproblemet på datorsystem med distribuerat minne (Svenska)
Abstract [en]

We present and discuss algorithms and library software for solving the generalized non-symmetric eigenvalue problem (GNEP) on high performance computing (HPC) platforms with distributed memory. Such problems occur frequently in computational science and engineering, and our contributions make it possible to solve GNEPs fast and accurate in parallel using state-of-the-art HPC systems. A generalized eigenvalue problem corresponds to finding scalars y and vectors x such that Ax = yBx, where A and B are real square matrices. A nonzero x that satisfies the GNEP equation is called an eigenvector of the ordered pair (A,B), and the scalar y is the associated eigenvalue. Our contributions include parallel algorithms for transforming a matrix pair (A,B) to a generalized Schur form (S,T), where S is quasi upper triangular and T is upper triangular. The eigenvalues are revealed from the diagonals of S and T. Moreover, for a specified set of eigenvalues an associated pair of deflating subspaces can be computed, which typically is requested in various applications. In the first stage the matrix pair (A,B) is reduced to a Hessenberg-triangular form (H,T), where H is upper triangular with one nonzero subdiagonal and T is upper triangular, in a finite number of steps. The second stage reduces the matrix pair further to generalized Schur form (S,T) using an iterative QZ-based method. Outgoing from a one-stage method for the reduction from (A,B) to (H,T), a novel parallel algorithm is developed. In brief, a delayed update technique is applied to several partial steps, involving low level operations, before associated accumulated transformations are applied in a blocked fashion which together with a wave-front task scheduler makes the algorithm scale when running in a parallel setting. The potential presence of infinite eigenvalues makes a generalized eigenvalue problem ill-conditioned. Therefore the parallel algorithm for the second stage, reduction to (S,T) form, continuously scan for and robustly deflate infinite eigenvalues. This will reduce the impact so that they do not interfere with other real eigenvalues or are misinterpreted as real eigenvalues. In addition, our parallel iterative QZ-based algorithm makes use of multiple implicit shifts and an aggressive early deflation (AED) technique, which radically speeds up the convergence. The multi-shift strategy is based on independent chains of so called coupled bulges and computational windows which is an important source of making the algorithm scalable. The parallel algorithms have been implemented in state-of-the-art library software. The performance is demonstrated and evaluated using up to 1600 CPU cores for problems with matrices as large as 100000 x 100000. Our library software is described in a User Guide. The software is, optionally, tunable via a set of parameters for various thresholds and buffer sizes etc. These parameters are discussed, and recommended values are specified which should result in reasonable performance on HPC systems similar to the ones we have been running on.

Ort, förlag, år, upplaga, sidor
Umeå: Umeå universitet , 2016. , s. 18
Serie
Report / UMINF, ISSN 0348-0542 ; 16.11
Nationell ämneskategori
Datavetenskap (datalogi)
Forskningsämne
data- och systemvetenskap
Identifikatorer
URN: urn:nbn:se:umu:diva-119439ISBN: 978-91-7601-491-2 (tryckt)OAI: oai:DiVA.org:umu-119439DiVA, id: diva2:920846
Presentation
2016-05-27, MC313, Umeå universitet, Umeå, 10:00 (Engelska)
Handledare
Tillgänglig från: 2016-04-19 Skapad: 2016-04-19 Senast uppdaterad: 2018-06-07Bibliografiskt granskad
Delarbeten
1. A parallel QZ algorithm for distributed memory HPC systems
Öppna denna publikation i ny flik eller fönster >>A parallel QZ algorithm for distributed memory HPC systems
2014 (Engelska)Ingår i: SIAM Journal on Scientific Computing, ISSN 1064-8275, E-ISSN 1095-7197, Vol. 36, nr 5, s. C480-C503Artikel i tidskrift (Refereegranskat) Published
Abstract [en]

Appearing frequently in applications, generalized eigenvalue problems represent one of the core problems in numerical linear algebra. The QZ algorithm of Moler and Stewart is the most widely used algorithm for addressing such problems. Despite its importance, little attention has been paid to the parallelization of the QZ algorithm. The purpose of this work is to fill this gap. We propose a parallelization of the QZ algorithm that incorporates all modern ingredients of dense eigensolvers, such as multishift and aggressive early deflation techniques. To deal with (possibly many) infinite eigenvalues, a new parallel deflation strategy is developed. Numerical experiments for several random and application examples demonstrate the effectiveness of our algorithm on two different distributed memory HPC systems.

Ort, förlag, år, upplaga, sidor
SIAM publications, 2014
Nyckelord
generalized eigenvalue problem, nonsymmetric QZ algorithm, multishift, bulge chasing, infinite genvalues, parallel algorithms, level 3 performance, aggressive early deflation, MMEL J, 1993, ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, V19, P175
Nationell ämneskategori
Matematik Datavetenskap (datalogi)
Identifikatorer
urn:nbn:se:umu:diva-97903 (URN)10.1137/140954817 (DOI)000346123200025 ()
Tillgänglig från: 2015-01-12 Skapad: 2015-01-08 Senast uppdaterad: 2018-06-07Bibliografiskt granskad
2. Distributed one-stage Hessenberg-triangular reduction with wavefront scheduling
Öppna denna publikation i ny flik eller fönster >>Distributed one-stage Hessenberg-triangular reduction with wavefront scheduling
2016 (Engelska)Rapport (Övrigt vetenskapligt)
Abstract [en]

A novel parallel formulation of Hessenberg-triangular reduction of a regular matrix pair on distributed memory computers is presented. The formulation is based on a sequential cache-blocked algorithm by Kågstrom, Kressner, E.S. Quintana-Ortí, and G. Quintana-Ortí (2008). A static scheduling algorithm is proposed that addresses the problem of underutilized processes caused by two-sided updates of matrix pairs based on sequences of rotations. Experiments using up to 961 processes demonstrate that the new algorithm is an improvement of the state of the art but also identifies factors that currently limit its scalability.

Ort, förlag, år, upplaga, sidor
Umeå: Department of Computing Science, Umeå University, 2016. s. 26
Serie
Report / UMINF, ISSN 0348-0542 ; 16.10
Nationell ämneskategori
Beräkningsmatematik
Identifikatorer
urn:nbn:se:umu:diva-120002 (URN)
Tillgänglig från: 2016-05-04 Skapad: 2016-05-04 Senast uppdaterad: 2018-06-07Bibliografiskt granskad
3. PDHGEQZ user guide
Öppna denna publikation i ny flik eller fönster >>PDHGEQZ user guide
2015 (Engelska)Rapport (Övrigt vetenskapligt)
Abstract [en]

Given a general matrix pair (A,B) with real entries, we provide software routines for computing a generalized Schur decomposition (S, T). The real and complex conjugate pairs of eigenvalues appear as 1×1 and 2×2 blocks, respectively, along the diagonals of (S, T) and can be reordered in any order. Typically, this functionality is used to compute orthogonal bases for a pair of deflating subspaces corresponding to a selected set of eigenvalues. The routines are written in Fortran 90 and targets distributed memory machines.

Ort, förlag, år, upplaga, sidor
Umeå: Department of Computing Science, Umeå University, 2015. s. 16
Serie
Report / UMINF, ISSN 0348-0542 ; 15.12
Nyckelord
software, userguide, generalized eigenvalue problem, nonsymmetric QZ algorithm, multishift, bulge chasing, infinite eigenvalues, parallel algorithms, level 3 performance, aggressive early deflation
Nationell ämneskategori
Beräkningsmatematik
Identifikatorer
urn:nbn:se:umu:diva-120008 (URN)
Tillgänglig från: 2016-05-04 Skapad: 2016-05-04 Senast uppdaterad: 2018-06-07Bibliografiskt granskad

Open Access i DiVA

fulltext(304 kB)257 nedladdningar
Filinformation
Filnamn FULLTEXT01.pdfFilstorlek 304 kBChecksumma SHA-512
8eda1f34715ba93d8617e1ebfe564b06653892046ca12da4deb44e1548564f8932d196d55d78a0fdf109f7abd73a2cb018a98cc5b9a220788a4b4a177b8a9db9
Typ fulltextMimetyp application/pdf

Personposter BETA

Adlerborn, Björn

Sök vidare i DiVA

Av författaren/redaktören
Adlerborn, Björn
Av organisationen
Institutionen för datavetenskapHögpresterande beräkningscentrum norr (HPC2N)
Datavetenskap (datalogi)

Sök vidare utanför DiVA

GoogleGoogle Scholar
Totalt: 257 nedladdningar
Antalet nedladdningar är summan av nedladdningar för alla fulltexter. Det kan inkludera t.ex tidigare versioner som nu inte längre är tillgängliga.

isbn
urn-nbn

Altmetricpoäng

isbn
urn-nbn
Totalt: 1406 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf