Task Scheduling with Configuration Prefetching and Anti-Fragmentation techniques on Dynamically Reconfigurable Systems

Aim of this paper is to define a scheduling of the task graph of an application that minimizes its total execution time on a partially dynamically reconfigurable FPGA. The scheduler has to take into account the reconfiguration overhead of each task, the area constraint of the target FPGA, the precedences between the tasks, configuration prefetching and module reuse. We introduce an ILP formulation to solve the task scheduling problem in the reconfigurable architecture scenario. This formulation has been used to identify interesting features for a possible heuristic scheduler. The results of the ILP solution show how a reconfiguration- aware scheduler exploiting all the reconfiguration features can outperform one with partial knowledge.

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

[2]  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.

[3]  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).

[4]  Ranga Vemuri,et al.  Temporal partitioning combined with design space exploration for latency minimization of run-time reconfigured designs , 1999, Design, Automation and Test in Europe Conference and Exhibition, 1999. Proceedings (Cat. No. PR00078).

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

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

[7]  Hideharu Amano,et al.  Performance evaluation of WASMII: a data driven computer on a virtual hardware , 1993, PARLE.

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

[9]  Ranga Vemuri,et al.  An automated temporal partitioning and loop fission approach for FPGA based reconfigurable synthesis of DSP applications , 1999, Proceedings 1999 Design Automation Conference (Cat. No. 99CH36361).

[10]  Wayne L. Winston.  Introduction to Mathematical Programming: Applications and Algorithms , 1990 .

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

[12]  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.

[13]  Vincenzo Piuri,et al.  Virtual FPGAs: Some Steps Behind the Physical Barriers , 1998, IPPS/SPDP Workshops.

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

[15]  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..