Mapping applications to an fpfa tile

Abstract — This paper introduces a transformational de-sign method which can be used to map code written in a high level source language, like C, to a coarse grain reconfig-urable architecture. The source code is first translated into a Control Dataflow graph (CDFG), which is minimized using a set of behaviour preserving transformations such as de-pendency analysis, common subexpression elimination, etc. After applying graph clustering, scheduling and allocation transformations on this minimized graph, it can be mapped onto the target architecture. I