Name
Abstract | ||
|---|---|---|
Reconfigurable computing systems have shown the potential to surpass conventional processor architectures in performance for a growing range of applications. That performance, however, must be attained without significantly changing the design effort on the programmer's part, and without drastically increasing compilation time. In this paper, we present our compiler framework for mapping computation kernels to the reconfigurable clusters of Amalgam, a clustered programmable-reconfigurable processor. We first promote the use of the gated singular-assignment program dependence graph, a parallel intermediate program representation, to represent computation kernels. We then present an algorithm for mapping a computation kernel into the control FSM and datapath for a reconfigurable cluster. Finally, we describe our fast datapath synthesis tool-flow which preserves regularity and reduces the problem size by not flattening the datapath to gates. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1109/FPT.2003.1275796 | Field-Programmable Technology |
Keywords | Field | DocType |
data flow graphs,finite state machines,program compilers,reconfigurable architectures,Amalgam reconfigurable clusters,FSM,clustered programmable reconfigurable processor,compilation time,datapath synthesis tool,finite state machines,gated singular assignment program,mapping computation Kernel,parallel intermediate program representation,processor architecture,reconfigurable computing systems | Kernel (linear algebra),Program Dependence Graph,Datapath,Programmer,Computer science,Parallel computing,Finite-state machine,Real-time computing,Compiler,Reconfigurable computing,Computation | Conference |
ISBN | Citations | PageRank |
0-7803-8320-6 | 0 | 0.34 |
References | Authors | |
3 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jeffrey J. Cook | 1 | 110 | 7.45 |
| Baugh, L.W. | 2 | 0 | 0.34 |
| Derek B. Gottlieb | 3 | 9 | 2.73 |
| Nicholas P. Carter | 4 | 349 | 33.84 |