A Flexible Graph Language for a Model-Based Semi-Automatic CGRA Compilation Flow

Extensive compiler support is a key-necessity for the general acceptance and usability of the promising Coarse Grained Reconfigurable Array (CGRA) accelerator architecture. However, there is currently little work to seamlessly connect mathematical graph-based modeling/programming languages and graph-based intermediate representations into a model-based semi-automatic compilation flow in which experts from different domains can collaborate interactively. Therefore, we present a flexible graph language with well-defined execution semantics which facilitates this intended compilation flow by supporting multiple user-defined abstractions. Starting with an abstract mathematical kernel description, we show that different mappings to a modern CGRA can be explored in an under-standable way with our language. We argue that our work is a promising starting point to increase the understandability and accessibility of CGRA compilation.