Task graph scheduling for reconfigurable architectures driven by reconfigurations hiding and resources reuse

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.

[1]  Nikil D. Dutt,et al.  PARLGRAN: parallelism granularity selection for scheduling task chains on dynamically reconfigurable architectures , 2006, Asia and South Pacific Conference on Design Automation, 2006..

[2]  Javier Resano,et al.  Specific scheduling support to minimize the reconfiguration overhead of dynamically reconfigurable hardware , 2004, Proceedings. 41st Design Automation Conference, 2004..

[3]  John Cocke,et al.  A methodology for the real world , 1981 .

[4]  João M. P. Cardoso,et al.  Loop dissevering: a technique for temporally partitioning loops in dynamically reconfigurable computing platforms , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[5]  Nikil D. Dutt,et al.  Considering run-time reconfiguration overhead in task graph transformations for dynamically reconfigurable architectures , 2005, 13th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM'05).

[6]  Nikil D. Dutt,et al.  Integrating Physical Constraints in HW-SW Partitioning for Architectures With Partial Dynamic Reconfiguration , 2006, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[7]  Gregory J. Chaitin,et al.  Register allocation & spilling via graph coloring , 1982, SIGPLAN '82.

[8]  John Cocke,et al.  Register Allocation Via Coloring , 1981, Comput. Lang..

[9]  Stamatis Vassiliadis,et al.  Compiler-driven FPGA-area allocation for reconfigurable computing , 2006, Proceedings of the Design Automation & Test in Europe Conference.

[10]  Marco D. Santambrogio,et al.  Task Partitioning for the Scheduling on Reconfigurable Systems driven by Specification Self-Similarity , 2007, ERSA.

[11]  Nikil D. Dutt,et al.  Physically-aware HW-SW partitioning for reconfigurable architectures with partial dynamic reconfiguration , 2005, Proceedings. 42nd Design Automation Conference, 2005..

[12]  K. Jafri,et al.  Constraint based temporal partitioning model for partial reconfigurable architectures , 2003, 7th International Multi Topic Conference, 2003. INMIC 2003..

[13]  J.M.P. Cardoso,et al.  Compilation for FPGA-based reconfigurable hardware , 2003, IEEE Design & Test of Computers.

[14]  Fabrizio Ferrandi,et al.  Solving the Coloring Problem to Schedule on Partially Dynamically Reconfigurable Hardware , 2005 .

[15]  Gregory J. Chaitin,et al.  Register allocation and spilling via graph coloring , 2004, SIGP.

[16]  João M. P. Cardoso.  On Combining Temporal Partitioning and Sharing of Functional Units in Compilation for Reconfigurable Architectures , 2003, IEEE Trans. Computers.

[17]  Majid Sarrafzadeh,et al.  Optimal reconfiguration sequence management , 2003, ASP-DAC '03.

[18]  Sze-Tsen Hu.  Introduction to Contemporary Mathematics , 1966 .