DocumentCode
2138783
Title
Configuration merging for adaptive computer applications
Author
Kasprzyk, Nico ; van Der Veen, Jan C. ; Koch, Andreas
Author_Institution
Dept. for Integrated Circuit Design, Tech. Univ. Braunschweig, Germany
fYear
2005
fDate
24-26 Aug. 2005
Firstpage
217
Lastpage
222
Abstract
We present experimental evidence that multiple compute-units, compiled from sequential high-level language input programs, can be merged into a reduced number of configurations for a reconfigurable fabric (such as a modem FPGA), thus significantly reducing the reconfiguration overhead. For cases requiring multiple configurations, both heuristical and exact algorithms to solve the configuration merging problem are described.
Keywords
adaptive systems; high level languages; reconfigurable architectures; adaptive computer applications; configuration merging problem; exact algorithms; heuristic algorithms; multiple compute units; reconfigurable fabric; sequential high-level language input programs; Application software; Clocks; Computer applications; Dynamic scheduling; Fabrics; Field programmable gate arrays; High level languages; Kernel; Merging; Switches;
fLanguage
English
Publisher
ieee
Conference_Titel
Field Programmable Logic and Applications, 2005. International Conference on
Print_ISBN
0-7803-9362-7
Type
conf
DOI
10.1109/FPL.2005.1515725
Filename
1515725
Link To Document