Abstract
| Original language | Undefined |
|---|---|
| Title of host publication | New Algorithms, Architectures and Applications for Reconfigurable Computing |
| Editors | Patrick Lysaght, Wolfgang Rosenstiel |
| Place of Publication | Dordrecht |
| Publisher | Kluwer Academic Publishers |
| Pages | 93-104 |
| Number of pages | 12 |
| ISBN (Print) | 978-1-4020-3127-4 |
| DOIs | |
| Publication status | Published - Jul 2005 |
Publication series
| Name | |
|---|---|
| Publisher | Kluwer Academic Publishers |
Keywords
- IR-49527
- Coarse Grain Reconfigurable Architecture - Mapping and Scheduling
- EWI-6916
- CAES-EEA: Efficient Embedded Architectures
- METIS-228217
Cite this
}
Mapping applications to a coarse grain reconfigurable system. / Guo, Y.; Smit, Gerardus Johannes Maria; Broersma, Haitze J.; Rosien, M.A.J.; Heysters, P.M.; Krol, Th.
New Algorithms, Architectures and Applications for Reconfigurable Computing. ed. / Patrick Lysaght; Wolfgang Rosenstiel. Dordrecht : Kluwer Academic Publishers, 2005. p. 93-104.Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic › peer-review
TY - CHAP
T1 - Mapping applications to a coarse grain reconfigurable system
AU - Guo, Y.
AU - Smit, Gerardus Johannes Maria
AU - Broersma, Haitze J.
AU - Rosien, M.A.J.
AU - Heysters, P.M.
AU - Krol, Th.
PY - 2005/7
Y1 - 2005/7
N2 - 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.
AB - 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.
KW - IR-49527
KW - Coarse Grain Reconfigurable Architecture - Mapping and Scheduling
KW - EWI-6916
KW - CAES-EEA: Efficient Embedded Architectures
KW - METIS-228217
U2 - 10.1007/1-4020-3128-9_8
DO - 10.1007/1-4020-3128-9_8
M3 - Chapter
SN - 978-1-4020-3127-4
SP - 93
EP - 104
BT - New Algorithms, Architectures and Applications for Reconfigurable Computing
A2 - Lysaght, Patrick
A2 - Rosenstiel, Wolfgang
PB - Kluwer Academic Publishers
CY - Dordrecht
ER -