2021 IEEE/ACM International Symposium on Code Generation and Optimization (CGO) 2021
DOI: 10.1109/cgo51591.2021.9370316
|View full text |Cite
|
Sign up to set email alerts
|

YaskSite: Stencil Optimization Techniques Applied to Explicit ODE Methods on Modern Architectures

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
1
1

Relationship

2
0

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 31 publications
0
2
0
Order By: Relevance
“…Real caches, such as on the A64FX, have finite associativity and might only implement a pseudo‐LRU policy. However, it has been shown in References 11,29 that for most stencil codes these assumptions do not hamper the quality of the predictions. For simplicity we assume in the following that the lattice is sufficiently large such that the working set does not fit into cache.…”
Section: Case Study: Lattice Qcd Dw Kernelmentioning
confidence: 99%
“…Real caches, such as on the A64FX, have finite associativity and might only implement a pseudo‐LRU policy. However, it has been shown in References 11,29 that for most stencil codes these assumptions do not hamper the quality of the predictions. For simplicity we assume in the following that the lattice is sufficiently large such that the working set does not fit into cache.…”
Section: Case Study: Lattice Qcd Dw Kernelmentioning
confidence: 99%
“…Real caches, such as on the A64FX, have finite associativity and might only implement a pseudo-LRU policy. However, it has been shown in [11,29] that for most stencil codes these assumptions do not hamper the quality of the predictions. For simplicity we assume in the following that the lattice is sufficiently large such that the working set does not fit into cache.…”
Section: Layer Conditionsmentioning
confidence: 99%