Configuration Merging for Adaptive Computer Applications

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 modern 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.

• Type: Conference
• Year: 2005
• Where: FPL
• Authors: Nico Kasprzyk, Jan van der Veen, Andreas Koch
• Keywords: Configuration Merging Problem, FPL 2005, Modern Fpga, Multiple Compute-units