A new approach based on LFF for optimization of dynamic hardware reconfigurations

FPGA placement is a two dimensional placement problem. But recent generations of FPGA allow run-time dynamic reconfiguration. We extend another dimension denoting execution time, so the optimization of the dynamic hardware reconfiguration problem becomes a three dimensional rectangle placement problem with spatial and temporal constraints. In this paper, we propose a new deterministic algorithm LFF (less flexibility first principle), which is derived from human accumulated experience and first presented for a two dimensional packing problem, to solve this problem. Good experimental results show that LFF is very effective and promising.