2022
DOI: 10.1007/s10766-022-00734-5
|View full text |Cite
|
Sign up to set email alerts
|

A Methodology for Efficient Tile Size Selection for Affine Loop Kernels

Abstract: including the URL of the record and the reason for the withdrawal request.Noname manuscript No.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
0
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 34 publications
0
0
0
Order By: Relevance
“…Applying loop tiling to d-loop is not efficient, as first, the out array is loaded and stored multiple times in this case, second, the tiles of in contain non-consecutive memory locations (with the current layout) and thus they cannot entirely fit into the cache [25]. k.y/k.x loops are too small for applying tiling.…”
Section: Parallelization Loop Tiling and Loop Permutationmentioning
confidence: 99%
“…Applying loop tiling to d-loop is not efficient, as first, the out array is loaded and stored multiple times in this case, second, the tiles of in contain non-consecutive memory locations (with the current layout) and thus they cannot entirely fit into the cache [25]. k.y/k.x loops are too small for applying tiling.…”
Section: Parallelization Loop Tiling and Loop Permutationmentioning
confidence: 99%