Mapping applications to a coarse grain reconfigurable system

Y. Guo, Gerardus Johannes Maria Smit, Haitze J. Broersma, M.A.J. Rosien, P.M. Heysters, Th. Krol

Research output: Chapter in Book/Report/Conference proceedingChapterAcademicpeer-review

3 Citations (Scopus)
190 Downloads (Pure)


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.
Original languageUndefined
Title of host publicationNew Algorithms, Architectures and Applications for Reconfigurable Computing
EditorsPatrick Lysaght, Wolfgang Rosenstiel
Place of PublicationDordrecht
PublisherKluwer Academic Publishers
Number of pages12
ISBN (Print)978-1-4020-3127-4
Publication statusPublished - Jul 2005

Publication series

PublisherKluwer Academic Publishers


  • IR-49527
  • Coarse Grain Reconfigurable Architecture - Mapping and Scheduling
  • EWI-6916
  • CAES-EEA: Efficient Embedded Architectures
  • METIS-228217

Cite this