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 proceeding › Chapter › Academic › peer-review

3 Citations (Scopus)
67 Downloads (Pure)

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

Publication series

Name
PublisherKluwer Academic Publishers

Keywords

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

Access to Document

    Cite this

    Guo, Y., Smit, G. J. M., Broersma, H. J., Rosien, M. A. J., Heysters, P. M., & Krol, T. (2005). Mapping applications to a coarse grain reconfigurable system. In P. Lysaght, & W. Rosenstiel (Eds.), New Algorithms, Architectures and Applications for Reconfigurable Computing (pp. 93-104). Dordrecht: Kluwer Academic Publishers. https://doi.org/10.1007/1-4020-3128-9_8