On the placement and granularity of FPGA configurations

Dynamic FPGA reconfiguration represents an overhead that can be critical to the performance of a realised circuit. To address this problem, This work presents a technique that is applicable at the times of loading the configuration data on the device. The technique involves reusing the on-chip configuration fragments to implement the next configuration thereby reducing the amount of data that must be externally transferred to the configuration memory. This work provides an analysis of the effect of circuit placement and configuration granularity on configuration reuse. The problem of finding placements of each circuit in a sequence of circuits so as to maximize configuration re-use is considered in detail. A greedy solution to this NP complete problem was found to reduce configuration overheads by less than 5% for a benchmark set. The effect of configuration granularity on configuration reuse was also considered and it was found that reducing the size of the unit of configuration allowed us to reduce the size of the benchmark configurations by 41%.

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

[2]  André DeHon.  Entropy, Counting, and Programmable Interconnect , 1996, Fourth International ACM Symposium on Field-Programmable Gate Arrays.

[3]  Seth Copen Goldstein,et al.  Configuration Caching and Swapping , 2001, FPL.

[4]  Michael J. Wirthlin,et al.  DISC: the dynamic instruction set computer , 1995, Optics East.

[5]  Dror Rawitz,et al.  The hardness of cache conscious data placement , 2002, POPL '02.

[6]  Marco Platzner,et al.  Reconfigurable Hardware Operating Systems: From Design Concepts to Realizations , 2003, Engineering of Reconfigurable Systems and Algorithms.

[7]  Cameron D. Patterson.  High Performance DES Encryption in Virtex(tm) FPGAs Using Jbits(tm) , 2000 .

[8]  Zhiyuan Li,et al.  Configuration Compression for Virtex FPGAs , 2001, The 9th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM'01).

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

[10]  Steven A. Guccione,et al.  Automated extraction of run-time parameterisable cores from programmable device configurations , 2000, Proceedings 2000 IEEE Symposium on Field-Programmable Custom Computing Machines (Cat. No.PR00871).

[11]  Herman Schmit.  Incremental reconfiguration for pipelined applications , 1997, Proceedings. The 5th Annual IEEE Symposium on Field-Programmable Custom Computing Machines Cat. No.97TB100186).

[12]  Viktor K. Prasanna,et al.  Configuration compression for FPGA-based embedded systems , 2005, IEEE Trans. Very Large Scale Integr. Syst..

[13]  John D. Villasenor,et al.  Video communications using rapidly reconfigurable hardware , 1995, IEEE Trans. Circuits Syst. Video Technol..

[14]  Jürgen Teich,et al.  Platform-independent methodology for partial reconfiguration , 2004, CF '04.

[15]  Wayne Luk,et al.  Compilation tools for run-time reconfigurable designs , 1997, Proceedings. The 5th Annual IEEE Symposium on Field-Programmable Custom Computing Machines Cat. No.97TB100186).

[16]  Cameron Patterson.  High performance DES encryption in Virtex/sup TM/ FPGAs using JBits/sup TM/ , 2000, Proceedings 2000 IEEE Symposium on Field-Programmable Custom Computing Machines (Cat. No.PR00871).

[17]  Irwin Kennedy.  Exploiting Redundancy to Speedup Reconfiguration of an FPGA , 2003, FPL.