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]  Martin Middendorf,et al.  Hyperreconfigurable architectures and the partition into hypercontexts problem , 2005, J. Parallel Distributed Comput..

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

[3]  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.

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

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