Mapping Applications to an FPFA Tile


Share/Save/Bookmark

Rosien, Michel A.J. and Guo, Yuanqing and Smit, G.J.M. and Krol, Thijs (2003) Mapping Applications to an FPFA Tile. In: Design, Automation and Test in Europe Conference and Exhibition, 2003, DATE, March 3-7, Munich, Germany.

[img]
Preview
PDF
268Kb
Abstract:This paper introduces a transformational design method which can be used to map code written in a high level source language, like C, to a coarse grain reconfigurable architecture. The source code is first translated into a control data flow graph (CDFG), which is minimized using a set of behaviour preserving transformations, such as dependency 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.
Item Type:Conference or Workshop Item
Copyright:©2003 IEEE
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/46339
Official URL:http://dx.doi.org/10.1109/DATE.2003.1253764
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 214675