The advances in the programmable hardware have lead to new architectures where the hardware can be dynamically adapted to the application to gain better performance. There are still many challenging problems to solve 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 runtime and is not known a priori, and offline 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.
|Original language||English (US)|
|Number of pages||10|
|Journal||Design Automation for Embedded Systems|
|State||Published - 2000|
|Event||10th IEEE International Workshop on Rapid System Prototyping (RSP'99) - Tampa, FL, USA|
Duration: Jun 16 1999 → Jun 18 1999
Bibliographical noteFunding Information:
This work was supported by DARPA under contract number DABT63-97-C-0035.