On the design of two-level reconfigurable architectures

In this paper we study a fundamental design problem for 2-level reconfigurable architectures (which are a special case of hyperreconfigurable architectures). On the lower reconfiguration level such architectures perform ordinary dynamic reconfiguration operations. On the upper level they can dynamically change the reconfiguration capabilities of the reconfigurable resources that are available for the lower level reconfiguration. Resources which have reduced reconfiguration capabilities can be reconfigured fast because not much reconfiguration information is needed to determine the new states of the resources. Whereas resources with larger reconfiguration capabilities have the advantage of higher flexibility but need more reconfiguration information. So far 2-level reconfigurable architectures have been used mainly as a concept to study the potential and limits of dynamic reconfiguration from a general point of view and based on formal models. The design problem that is addressed here is to find the best level of granularity that should be provided by the architecture for the upper level reconfiguration operations. A fine granularity allows the upper level reconfiguration operations to adapt the reconfiguration capabilities of the resources such that: i) the provided flexibility matches closely the actual needs, and ii) not too much reconfiguration information is needed. A possible disadvantage of a fine granularity is that the upper level reconfiguration operations themselves need more reconfiguration information. We give a formal definition of the corresponding hypercontext design problem (HDP) and show theoretical results on the complexity of this problem. Moreover we describe a heuristic for solving the HDP and study three example problems

[1]  Zhiyuan Li,et al.  Configuration compression for the Xilinx XC6200 FPGA , 1998, Proceedings. IEEE Symposium on FPGAs for Custom Computing Machines (Cat. No.98TB100251).

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

[3]  Jürgen Teich,et al.  (Self-)reconfigurable finite state machines: theory and implementation , 2002, Proceedings 2002 Design, Automation and Test in Europe Conference and Exhibition.

[4]  Viktor K. Prasanna,et al.  A Self-Reconfigurable Gate Array Architecture , 2000, FPL.

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

[6]  Martin D. F. Wong,et al.  Incremental reconfiguration of multi-FPGA systems , 2002, FPGA '02.

[7]  Martin Middendorf,et al.  Multi task hyperreconfigurable architectures: models and reconfiguration problems , 2005, Int. J. Embed. Syst..

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

[9]  Andreas Dandalis,et al.  Efficient Self-Reconfigurable Implementations Using On-chip Memory , 2000, FPL.

[10]  Scott Hauck,et al.  Reconfigurable computing: a survey of systems and software , 2002, CSUR.

[11]  Martin Middendorf,et al.  Models and reconfiguration problems for multi task hyperreconfigurable architectures , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[12]  Viktor K. Prasanna,et al.  Reconfigurable computing: Architectures, mod- els and algorithms , 2000 .