Umeå University's logo

umu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A Task-Based Algorithm for Reordering the Eigenvalues of a Matrix in Real Schur Form
Umeå University, Faculty of Science and Technology, Department of Computing Science.ORCID iD: 0000-0002-3689-0899
2018 (English)In: Parallel Processing and Applied Mathematics: PPAM 2017 / [ed] Roman Wyrzykowski, Jack Dongarra, Ewa Deelman, Konrad Karczewski, Springer, 2018, p. 207-216Conference paper, Published paper (Refereed)
Abstract [en]

A task-based parallel algorithm for reordering the eigenvalues of a matrix in real Schur form is presented.The algorithm is realized on top of the StarPU runtime system.Only the aspects which are relevant for shared memory machines are discussed here, but the implementation can be configured to run on distributed memory machines as well.Various techniques to reduce the overhead and the core idle time are discussed.Computational experiments indicate that the new algorithm is between 1.5 and 6.6 times faster than a state of the art MPI-based implementation found in ScaLAPACK.With medium to large matrices, strong scaling efficiencies above 60\% up to 28 CPU cores are reported.The overhead and the core idle time are shown to be negligible with the exception of the smallest matrices and highest core counts.

Place, publisher, year, edition, pages
Springer, 2018. p. 207-216
Series
Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349 ; 10777
Keywords [en]
Eigenvalue reordering problem, Task based programming, Shared memory machines
National Category
Computer Sciences Computational Mathematics
Research subject
Computer Science
Identifiers
URN: urn:nbn:se:umu:diva-145987DOI: 10.1007/978-3-319-78024-5_19ISI: 000458563300019Scopus ID: 2-s2.0-85044751795ISBN: 978-3-319-78023-8 (print)ISBN: 978-3-319-78024-5 (electronic)OAI: oai:DiVA.org:umu-145987DiVA, id: diva2:1192964
Conference
12th International Conference on Parallel Processing and Applied Mathematics (PPAM 2017)
Available from: 2018-03-24 Created: 2018-03-24 Last updated: 2023-03-24Bibliographically approved

Open Access in DiVA

fulltext(362 kB)92 downloads
File information
File name FULLTEXT02.pdfFile size 362 kBChecksum SHA-512
5b143fe3bb22a8ab732b96e64266d2f3df0ba4a13326b6f924fd69d1e160e39f6610db714b600c1c333355d94bdd723cb6b79150b25d0e004bdc412c1daf10ce
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopus

Authority records

Myllykoski, Mirko

Search in DiVA

By author/editor
Myllykoski, Mirko
By organisation
Department of Computing Science
Computer SciencesComputational Mathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 92 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 413 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf