2017
DOI: 10.1007/s00607-017-0576-3
|View full text |Cite
|
Sign up to set email alerts
|

Generation of parallel synchronization-free tiled code

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 24 publications
0
2
0
Order By: Relevance
“…Analyzing the obtained set, we conclude that there exists a single parametric tile with identifier I I = [2,2]. It includes the following iterations: [5,5], [5,6], [6,1], [6,2], [6,3], [6,4], [6,5], [6,6] }.…”
Section: Card(t I L E_v L D)mentioning
confidence: 94%
See 1 more Smart Citation
“…Analyzing the obtained set, we conclude that there exists a single parametric tile with identifier I I = [2,2]. It includes the following iterations: [5,5], [5,6], [6,1], [6,2], [6,3], [6,4], [6,5], [6,6] }.…”
Section: Card(t I L E_v L D)mentioning
confidence: 94%
“…Paper [6] presents how to generate parallel synchronization-free tiled code based on transitive closure and the application of the discussed algorithm to different real-life benchmarks, but it does not provide any analysis of features of target tiles.…”
Section: Related Workmentioning
confidence: 99%