2018
DOI: 10.1016/j.dib.2018.08.092
|View full text |Cite
|
Sign up to set email alerts
|

Performance output data and configurations of stencil compilers experiments run through PROVA!

Abstract: The data in this article are related to the research article titled “Reproducible Stencil Compiler Benchmarks Using PROVA!”. Stencil kernels have been implemented using a naïve OpenMP (OpenMP Architecture Review Board, 2016) [1] parallelization and then using the stencil compilers PATUS (Christen et al., 2011) [2] and (Bondhugula et al., 2008) PLUTO [3]. Performance experiments have been run on different architectures, by using PROVA! (Guerrera et al., 2017) [4], a distributed workflow and system management to… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2019
2019
2019
2019

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 2 publications
0
1
0
Order By: Relevance
“…bor lists and re-building the domain less often. Furthermore, there is room to improve significantly the neighbor search algorithm on modern massively parallel architectures coupled with accelerators, as it is being currently investigated for a range of particle-based codes (Guerrera et al 2018).…”
Section: Computational Cost and Possible Applicationsmentioning
confidence: 99%
“…bor lists and re-building the domain less often. Furthermore, there is room to improve significantly the neighbor search algorithm on modern massively parallel architectures coupled with accelerators, as it is being currently investigated for a range of particle-based codes (Guerrera et al 2018).…”
Section: Computational Cost and Possible Applicationsmentioning
confidence: 99%