Task graph scheduling for reconfigurable architectures driven by reconfigurations hiding and resources reuse
Marco Domenico Santambrogio, Massimo Redaelli, Marco Maggioni · 2009
This paper is focused on the scheduling of tasks on partially dynamically reconfigurable FPGA s in order to minimize the overall latency of the application. We propose a novel approach to the partitioning of a system specification by detecting recurrent structures in the specification itself. This technique has the objective of identifying modules that can be used more than once during the system lifetime. In such a scenario the reconfiguration overhead is minimized via both the device resource reuse, due to the partitioner, and the reconfiguration time hiding, due to the scheduler. A model of reconfigurable hardware, both for the device and the application, will also be defined and presented.