Dynamic-II Pipeline: Compiling Loops With Irregular Branches on Static-Scheduling CGRA

Yuan, Baofen; Zhu, Jianfeng; Man, Xingchen; Ma, Zijiao; Yin, Shouyi; Wei, Shaojun; Liu., Leibo

doi:10.1109/tcad.2021.3121346

Cited by 4 publications

(1 citation statement)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…1) Conditional and alternative structures: Conditional and alternative structures are if-then-else (ITE) constructs. As clearly presented in [55], there are four basic methods to map applications with ITE onto CGRAs: (1) Full predication [56], (2) Partial predication [57], (3) Dual-issue single execution [55], [58], [59], (4) Direct CDFG mapping [60]. Supporting ITE constructs efficiently is still a hot topic, as witnessed by recent publications [55], [59].…”

Section: B Control-flow Mappingmentioning

confidence: 99%

Twenty Years of Automated Methods for Mapping Applications on CGRA

Martin

2022

2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)

View full text Add to dashboard Cite

Coarse-GrainedReconfigurable Architectures (CGRAs) emerged about 30 years ago. The very first CGRAs were programmed manually. Fortunately, some compilation approaches appeared rapidly to automate the mapping process. Numerous surveys on these architectures exist. Other surveys also gather the tools and methods, but none of them focuses on the mapping process only. This paper focuses solely on automated methods and techniques for mapping applications on CGRA and covers the last two decades of research. This paper aims at providing the terminology, the problem formulation, and a classification of existing methods. The paper ends with research challenges and trends for the future.

show abstract