Integrated temporal partitioning and partial reconfiguration techniques for design latency improvement

In this paper, we present a novel temporal partitioning methodology that temporally partitions a data flow graph on reconfigurable system. Our approach optimizes the whole latency of the design. This aim can be reached by minimizing the latency of the graph and the reconfiguration time at the same time. Consequently, our algorithm starts by an existing temporal partitioning. The existing temporal partitioning is the result of a whole latency optimization algorithm. Next, our approach builds the best architecture, on a partially reconfigurable FPGA, that gives the lowest value of reconfiguration time. The proposed methodology was tested on several examples on the Xilinx Virtex-II pro. The results show significant reduction in the design latency compared with others famous approaches used in this field.

[1]  Martin D. F. Wong,et al.  Network flow based multi-way partitioning with area and pin constraints , 1997, ISPD '97.

[2]  Jhing-Fa Wang,et al.  Temporal Partitioning Data Flow Graphs for Dynamically Reconfigurable Computing , 2007, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[3]  Mohamed Abid,et al.  An efficient list scheduling algorithm for time placement problem , 2007, Comput. Electr. Eng..

[4]  Abdellatif Mtibaa,et al.  Partitioning and scheduling technique for run time reconfigured systems , 2011, Int. J. Comput. Aided Eng. Technol..

[5]  Steven Trimberger,et al.  Scheduling designs into a time-multiplexed FPGA , 1998, FPGA '98.

[6]  Abdellatif Mtibaa,et al.  A partitioning methodology that optimizes the communication cost for reconfigurable computing systems , 2012, International Journal of Automation and Computing.

[7]  Yao-Wen Chang,et al.  Generic ILP-based approaches for time-multiplexed FPGA partitioning , 2001, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[8]  Jeff Mason,et al.  Invited Paper: Enhanced Architectures, Design Methodologies and CAD Tools for Dynamic Reconfiguration of Xilinx FPGAs , 2006, 2006 International Conference on Field Programmable Logic and Applications.

[9]  Milan Vasilko,et al.  Architectural Synthesis Techniques for Dynamically Reconfigurable Logic , 1996, FPL.

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

[11]  Henry L. Owen,et al.  Temporal Partitioning for Partially-Reconfigurable-Field-Programmable Gate , 1998, IPPS/SPDP Workshops.

[12]  Abdellatif Mtibaa,et al.  Temporal partitioning of data flow graph for dynamically reconfigurable architecture , 2011, J. Syst. Archit..

[13]  Abdellatif Mtibaa,et al.  Combining temporal partitioning and temporal placement techniques for communication cost improvement , 2011, Adv. Eng. Softw..

[14]  Martin D. F. Wong,et al.  Network-flow-based multiway partitioning with area and pin constraints , 1998, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[15]  Huiqun Liu,et al.  Network flow based circuit partitioning for time-multiplexed FPGAs , 1998, ICCAD 1998.