Sökning: id:"swepub:oai:DiVA.org:umu-147843" >
Distributed one-sta...
Distributed one-stage Hessenberg-triangular reduction with wavefront scheduling
-
- Adlerborn, Björn (författare)
- Umeå universitet,Institutionen för datavetenskap,Högpresterande beräkningscentrum norr (HPC2N)
-
- Karlsson, Lars (författare)
- Umeå universitet,Institutionen för datavetenskap,Högpresterande beräkningscentrum norr (HPC2N)
-
- Kågström, Bo (författare)
- Umeå universitet,Institutionen för datavetenskap,Högpresterande beräkningscentrum norr (HPC2N)
-
(creator_code:org_t)
- Society for Industrial and Applied Mathematics, 2018
- 2018
- Engelska.
-
Ingår i: SIAM Journal on Scientific Computing. - : Society for Industrial and Applied Mathematics. - 1064-8275 .- 1095-7197. ; 40:2, s. C157-C180
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- 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 cacheblocked algorithm by K degrees agstrom et al. [BIT, 48 (2008), pp. 563 584]. 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 formulation is an improvement of the state of the art and also identify factors that limit its scalability.
Ämnesord
- NATURVETENSKAP -- Matematik -- Beräkningsmatematik (hsv//swe)
- NATURAL SCIENCES -- Mathematics -- Computational Mathematics (hsv//eng)
Nyckelord
- generalized eigenvalue problem
- Hessenberg-triangular reduction
- parallel algorithms
- wavefront scheduling
Publikations- och innehållstyp
- ref (ämneskategori)
- art (ämneskategori)
Hitta via bibliotek
Till lärosätets databas