An optimisation communication cost algorithm for dynamically reconfigurable FPGAs

In this article, we present a sequential circuit partitioning algorithm to optimise the number of registers for dynamically reconfigurable FPGAs. The algorithm is divided into two phases: (1) the labelling phase and (2) the minimising cost phase. We first improved the ‘as soon as possible’ and ‘as late as possible’ algorithms to assign nodes so that the constraints of partition a sequential circuit partition are satisfied for dynamically reconfigurable FPGAs. Then, some nodes are adjusted or replicated to optimise the number of registers. Experimental results demonstrate the effectives of our algorithms.

[1]  André DeHon,et al.  DPGA Utilization and Application , 1996, Fourth International ACM Symposium on Field-Programmable Gate Arrays.

[2]  Santanu Chattopadhyay,et al.  Low power technology mapping for LUT based FPGA - a genetic algorithm approach , 2003, 16th International Conference on VLSI Design, 2003. Proceedings..

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

[4]  Jason Cong,et al.  On Area/Depth Trade-off in LUT-Based FPGA Technology Mapping , 1993, 30th ACM/IEEE Design Automation Conference.

[5]  Malgorzata Marek-Sadowska,et al.  Buffer minimization and time-multiplexed I/O on dynamically reconfigurable FPGAs , 1997, FPGA '97.

[6]  Martin D. F. Wong,et al.  Network flow based circuit partitioning for time-multiplexed FPGAs , 1998, ICCAD '98.

[7]  Kamal Chaudhary,et al.  Performance-oriented fully routable dynamic architecture for a field programmable logic dervice , 1993 .

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

[9]  Jason Cong,et al.  FlowMap: an optimal technology mapping algorithm for delay optimization in lookup-table based FPGA designs , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[10]  Yen-Tai Lai,et al.  An efficient algorithm for finding the minimal-area FPGA technology mapping , 2005, TODE.

[11]  Yao-Wen Chang,et al.  A clustering- and probability-based approach for time-multiplexed FPGA partitioning , 1998, 1999 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (Cat. No.99CH37051).

[12]  André DeHon,et al.  Reconfigurable architectures for general-purpose computing , 1996 .

[13]  Jing-Yang Jou,et al.  ALTO: an iterative area/performance tradeoff algorithm for LUT-based FPGA technology mapping , 2000, IEEE Trans. Very Large Scale Integr. Syst..

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

[15]  D. Jones,et al.  A time-multiplexed FPGA architecture for logic emulation , 1995, Proceedings of the IEEE 1995 Custom Integrated Circuits Conference.

[16]  Evangeline F. Y. Young,et al.  Temporal logic replication for dynamically reconfigurable FPGA partitioning , 2002, ISPD '02.

[17]  Jason Cong,et al.  Simultaneous logic decomposition with technology mapping in FPGA designs , 2001, FPGA '01.

[18]  Steven Trimberger,et al.  A time-multiplexed FPGA , 1997, Proceedings. The 5th Annual IEEE Symposium on Field-Programmable Custom Computing Machines Cat. No.97TB100186).