Mapping applications to a coarse grain reconfigurable system


Share/Save/Bookmark

Guo, Yuanqing and Smit, Gerard J.M. and Broersma, Hajo and Rosien, Michel A.J. and Heysters, Paul M. and Krol, Thijs (2004) Mapping applications to a coarse grain reconfigurable system. In: New Algorithms, Architectures and Applications for Reconfigurable Computing. Kluwer Academic Publishers. ISBN 9781402031274

[img]PDF
Restricted to UT campus only

568Kb
Abstract:This paper introduces a method which can be used to map applications written in a high level source language program, like C, to a coarse grain reconfigurable architecture, MONTIUM. The source code is first translated into a control dataflow graph. Then after applying graph clustering, scheduling and allocation on this control dataflow graph, it can be mapped onto the target architecture. The clustering and allocation algorithm are presented in detail. High performance and low power consumption are achieved by exploiting maximum parallelism and locality of reference respectively. Using our mapping method, the flexibility of the MONTIUM architecture can be exploited.
Item Type:Book Section
Copyright:© 2004 Springer
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/49527
Official URL:http://dx.doi.org/10.1007/1-4020-3128-9_8
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 222106