2014
DOI: 10.1016/j.parco.2014.04.009
|View full text |Cite
|
Sign up to set email alerts
|

Parallelization of 2D MPDATA EULAG algorithm on hybrid architectures with GPU accelerators

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
38
0

Year Published

2014
2014
2020
2020

Publication Types

Select...
6
1

Relationship

7
0

Authors

Journals

citations
Cited by 23 publications
(38 citation statements)
references
References 29 publications
0
38
0
Order By: Relevance
“…In previous works [26,35], we proved that MPDATA belongs to the group of memory-bound algorithms [13,36]. This makes MPDATA a challenging candidate for a technology such as dynamic VFS [16], which can reduce CPU energy consumption without a significant loss of performance.…”
Section: Overviewmentioning
confidence: 93%
“…In previous works [26,35], we proved that MPDATA belongs to the group of memory-bound algorithms [13,36]. This makes MPDATA a challenging candidate for a technology such as dynamic VFS [16], which can reduce CPU energy consumption without a significant loss of performance.…”
Section: Overviewmentioning
confidence: 93%
“…The achieved performance results showed the possibility of achieving high performance both on CPU and GPU platforms. Recently, we have developed [14] a hybrid CPU-GPU version of 2D MPDATA, to fully utilize all the available computing resources by spreading computations across the entire machine. To reveal performance constraints for the MPDATA algorithm running on hybrid architectures, we follow the simple methodology presented in [8], where the attainable performance is estimated based on the flop-per-byte ratio.…”
Section: Related Workmentioning
confidence: 99%
“…Such kernels have been investigated by many authors over the years [8,9,14,[20][21][22][23][24]. The main direction of memory optimizations for stencil computations has principally focused on different decomposition strategies, like space and temporal blocking techniques [20], that attempt to exploit locality by performing operations on data blocks of a suitable size before moving on to the next block.…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations