The platform will undergo maintenance on Sep 14 at about 7:45 AM EST and will be unavailable for approximately 2 hours.
2016
DOI: 10.1007/s11227-016-1881-x
|View full text |Cite
|
Sign up to set email alerts
|

A parallel solving method for block-tridiagonal equations on CPU–GPU heterogeneous computing systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
8
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 20 publications
(8 citation statements)
references
References 39 publications
0
8
0
Order By: Relevance
“…Then the numerical solution of such a set of inner boundary points can be calculated quickly only by solving the fourth order sparse linear Equation (15). In the same way, the points on the other five groups of inner boundary lines are also calculated by Group Explicit method, and we will not represent them one by one here.…”
Section: Implementation Of Even Level Iterationmentioning
confidence: 99%
See 1 more Smart Citation
“…Then the numerical solution of such a set of inner boundary points can be calculated quickly only by solving the fourth order sparse linear Equation (15). In the same way, the points on the other five groups of inner boundary lines are also calculated by Group Explicit method, and we will not represent them one by one here.…”
Section: Implementation Of Even Level Iterationmentioning
confidence: 99%
“…C. P. Stone et al [14] analyze the performance of a block tridiagonal benchmark. Many authors have given the implementation of scalar tridiagonal solver on GPUs [15][16][17]. Y. Zhang [16] also illustrates several methods to solve tridiagonal systems on GPUs.…”
Section: Introductionmentioning
confidence: 99%
“…On the other hand, some parallel computing algorithms are also designed for solving tridiagonal systems on graphics processing unit (GPU), which are parallel cyclic reduction [9] and partition methods [10]. Recently, Yang et al [11] presented a parallel solving method that mixes direct and iterative methods for block-tridiagonal equations on CPU-GPU heterogeneous computing systems, whereas Myllykoski et al [12] proposed a generalized graphics processing unit implementation of partial solution variant of the cyclic reduction (PSCR) method to solve certain types of separable block tridiagonal linear systems. Compared to an equivalent CPU implementation that utilizes a single CPU core, PSCR method indicated up to 24-fold speedups.…”
Section: Introductionmentioning
confidence: 99%
“…On the other hand, some parallel computing algorithms are also designed for solving tridiagonal systems on graphics processing unit (GPU), which are parallel cyclic reduction [18] and partition methods [19]. Recently, Yang et al [20] presented a parallel solving method which mixes direct and iterative methods for block-tridiagonal equations on CPU-GPU heterogeneous computing systems, while Myllykoski et al [21] proposed a generalized graphics processing unit implementation of partial solution variant of the cyclic reduction (PSCR) method to solve certain types of separable block tridiagonal linear systems. Compared to an equivalent CPU implementation that utilizes a single CPU core, PSCR method indicated up to 24-fold speedups.…”
Section: Introductionmentioning
confidence: 99%