3-D floorplanning: simulated annealing and greedy placement methods for reconfigurable computing systems

Advances in programmable hardware have led to new architectures where the hardware can be dynamically adapted to the application to gain better performance. There are still many challenging problems to be solved before any practical general-purpose reconfigurable system is built. One fundamental problem is the placement of the modules on the reconfigurable functional unit (RFU). In reconfigurable systems, we are interested both in online placement, where the arrival time of tasks is determined at run time and is not known a priori, and in offline placement, in which the schedule is known at compile time. In the case of offline placement, we are willing to spend more time during compile time to find a compact floorplan for the RFU modules and utilize the RFU area more efficiently. In this paper, we present offline placement algorithms based on simulated annealing and greedy methods, and show the superiority of their placements over the ones generated by an online algorithm