Twenty Years of Automated Methods for Mapping Applications on CGRA

Abstract

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.

Advancing signal integrity and application analysis through data-flow mapping

“…A data-flow graph is a directed graph with nodes symbolizing computations or operations and edges defining the data dependencies among them. This graph is pivotal for data-flow mapping as it visually delineates the manner in which data is transferred and modified between distinct operations or components [2].…”