2014
DOI: 10.1007/978-3-662-43880-0_52
|View full text |Cite
|
Sign up to set email alerts
|

Towards Efficient Decomposition and Parallelization of MPDATA on Hybrid CPU-GPU Cluster

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
15
0

Year Published

2014
2014
2020
2020

Publication Types

Select...
8
1

Relationship

8
1

Authors

Journals

citations
Cited by 15 publications
(15 citation statements)
references
References 10 publications
0
15
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: 94%
See 1 more Smart Citation
“…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: 94%
“…Those readers that are more interested in the specification of MPDATA and its implementation can refer to [29,34,36].…”
Section: Overviewmentioning
confidence: 99%
“…This approach allows to increase data locality and minimize the number of global memory transaction. Detailed description of the new GPU implementation one can find in [11]- [14].…”
Section: New C++ Implementation Of Mpdata For Cpumentioning
confidence: 99%
“…The proposed technique is based on stencil computations and is an extension of the concept described in previous studies [10]- [13]. In this paper, we assume prior knowledge about OpenCL programming and terminology.…”
Section: Adaptation Of Advection Transport Algorithm Mpdata To Gmentioning
confidence: 99%