Multi-level reconfigurable architectures in the switch model

In this paper, we study multi-level dynamically reconfigurable architectures. These are extensions of standard reconfigurable architectures where ordinary reconfiguration operations correspond to the lowest reconfiguration level. On each higher reconfiguration level the reconfiguration capabilities of the reconfigurable resources that are available on the level directly below can be reconfigured. We show that the problem to find optimal reconfigurations with an arbitrary number of reconfiguration levels can be found in polynomial time for the switch cost model. The problem of finding the optimal number of reconfiguration levels is shown to be solvable in polynomial time on homogeneous multi-level architectures but it becomes NP-hard for heterogeneous multi-level architectures. Moreover, we present experimental results for some example problems on a simple test architecture.

[1]  Massimo Violante,et al.  A new decompression system for the configuration process of SRAM-based FPGAS , 2007, GLSVLSI '07.

[2]  Peter M. Athanas,et al.  A versatile framework for FPGA field updates: an application of partial self-reconfiguration , 2003, 14th IEEE International Workshop on Rapid Systems Prototyping, 2003. Proceedings..

[3]  Adam Donlin,et al.  Self Modifying Circuitry - A Platform for Tractable Virtual Circuitry , 1998, FPL.

[4]  Martin Middendorf,et al.  Heuristics for context-caches in 2-level reconfigurable architectures , 2005, Proceedings. 2005 IEEE International Conference on Field-Programmable Technology, 2005..

[5]  Viktor K. Prasanna,et al.  Genetic Programming Using Self-Reconfigurable FPGAs , 1999, FPL.

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

[7]  José Luis Martín,et al.  Tornado: A self-reconfiguration control system for core-based multiprocessor CSoPCs , 2007, J. Syst. Archit..

[8]  André DeHon,et al.  MATRIX: a reconfigurable computing architecture with configurable instruction distribution and deployable resources , 1996, 1996 Proceedings IEEE Symposium on FPGAs for Custom Computing Machines.

[9]  Oliver Diessel,et al.  A configuration memory architecture for fast run-time reconfiguration of FPGAs , 2005, International Conference on Field Programmable Logic and Applications, 2005..

[10]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[11]  Martin Middendorf,et al.  On the design of two-level reconfigurable architectures , 2005, 2005 International Conference on Reconfigurable Computing and FPGAs (ReConFig'05).

[12]  Tulika Mitra,et al.  Configuration bitstream compression for dynamically reconfigurable FPGAs , 2004, ICCAD 2004.

[13]  Viktor K. Prasanna,et al.  Efficient Metacomputation Using Self-Reconfiguration , 2002, FPL.

[14]  J. Becker,et al.  Real-time configuration code decompression for dynamic FPGA self-reconfiguration , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[15]  Martin Middendorf,et al.  Hyperreconfigurable architectures and the partition into hypercontexts problem , 2005, J. Parallel Distributed Comput..

[16]  Zhiyuan Li,et al.  Configuration compression for the Xilinx XC6200 FPGA , 1999, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

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

[18]  Philip James-Roxby,et al.  A Self-reconfiguring Platform , 2003, FPL.

[19]  Neil W. Bergmann,et al.  QUKU: a two-level reconfigurable architecture , 2006, IEEE Computer Society Annual Symposium on Emerging VLSI Technologies and Architectures (ISVLSI'06).