Mapping Applications to a Coarse Grain Reconfigurable System

Yuanqing Guo, Gerard J.M. Smit, Hajo Broersma, Michél A.J. Rosien, Paul M. Heysters

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

2 Citations (Scopus)
46 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 data flow graph. Then after applying graph clustering, scheduling and allocation on this control data flow 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 languageEnglish
Title of host publicationAdvances in Computer Systems Architecture
Subtitle of host publication8th Asia-Pacific Conference, ACSAC 2003, Aizu-Wakamatsu, Japan, September 23-26, 2003. Proceedings
EditorsAmos Omondi, Stanislav Sedukhin
Place of PublicationBerlin, Heidelberg
Number of pages15
ISBN (Electronic)978-3-540-39864-6
ISBN (Print)978-3-540-20122-9
Publication statusPublished - Sept 2003
Event8th Asia-Pacific Computer Systems Architecture Conference, ACSAC 2003 - Aizu-Wakamatsu, Japan
Duration: 23 Sept 200326 Sept 2003
Conference number: 8

Publication series

NameLecture Notes in Computer Science
ISSN (Print)0302-9743


Conference8th Asia-Pacific Computer Systems Architecture Conference, ACSAC 2003
Abbreviated title ACSAC


  • CAES-EEA: Efficient Embedded Architectures
  • Clock cycle
  • Register bank
  • Mapping application
  • Very long instruction word
  • Load input


Dive into the research topics of 'Mapping Applications to a Coarse Grain Reconfigurable System'. Together they form a unique fingerprint.

Cite this