Scalable Run Time Reconfigurable Architecture

Currently multi-FPGA reconfigurable computing systems are still commonly used for accelerating algorithms. This technology where acceleration is achieved by spatial implementation of an algorithm in reconfigurable hardware has proven to be feasible. However, the best suiting algorithms are those who are very structured, can benefit from deep pipelining and need only local communication resources. Many algorithms can not fulfil the third requirement once the problem size grows and multi-FPGA systems become necessary. In this paper we address the emulation of a run time reconfigurable processor architecture, which scales better for this kind of computing problems.

[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]  Zhiyuan Li,et al.  Configuration compression for the Xilinx XC6200 FPGA , 1998, Proceedings. IEEE Symposium on FPGAs for Custom Computing Machines (Cat. No.98TB100251).

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

[4]  Vivek Sarkar,et al.  Baring it all to Software: The Raw Machine , 1997 .