2010 18th Euromicro Conference on Parallel, Distributed and Network-Based Processing 2010
DOI: 10.1109/pdp.2010.51
|View full text |Cite
|
Sign up to set email alerts
|

A Parallel Preconditioned Conjugate Gradient Solver for the Poisson Problem on a Multi-GPU Platform

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
48
0

Year Published

2011
2011
2020
2020

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 75 publications
(49 citation statements)
references
References 17 publications
1
48
0
Order By: Relevance
“…To compute execution time, we used system-specific high-resolution timers: mach absolute time() on Mac OS X* and clock gettime() on Linux*. We further refer the reader to [1] for GPU parallel implementations of the incomplete Poisson preconditioner. Figure 2 shows that PIPP scales very well with the number of available cores.…”
Section: Parallelization Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…To compute execution time, we used system-specific high-resolution timers: mach absolute time() on Mac OS X* and clock gettime() on Linux*. We further refer the reader to [1] for GPU parallel implementations of the incomplete Poisson preconditioner. Figure 2 shows that PIPP scales very well with the number of available cores.…”
Section: Parallelization Resultsmentioning
confidence: 99%
“…We also examine a new preconditioning scheme, the incomplete Poisson preconditioner, proposed by Ament et al [1] for the Poisson problem. Their motivation was to find an easily parallelizable preconditioner for simulations on multi-GPU systems.…”
Section: Preconditioning Methodsmentioning
confidence: 99%
“…In the case of very large sparse matrices, problems concerning the speed-up are considerably smaller [18]. Resigning from the standard libraries of universal functions [5] and introducing programs directly adapted to the analysis of the given problem [19][20][21][22][23] can additionally increase the efficiency of parallel computations which use a GPU.…”
Section: Discussionmentioning
confidence: 99%
“…The preconditioner in [2] offers as much parallelism as the number of degrees of freedom, N (or the number of unknowns). However, our experiments [1] show its use is limited for two-phase (high condition number, (κ)) flow problems.…”
Section: Related Workmentioning
confidence: 99%
“…However, our experiments [1] show its use is limited for two-phase (high condition number, (κ)) flow problems. An extension to [2] is provided in [8] wherein a relaxation factor is utilized. In [9] an incomplete LU decomposition based preconditioner with fill-in is used combined with reordering using multi-coloring.…”
Section: Related Workmentioning
confidence: 99%