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

K. Bazargan, R. Kastner, M. Sarrafzadeh

Research output: Contribution to journalArticlepeer-review

24 Scopus citations

Abstract

The advances in the programmable hardware has 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 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 on-line placement, where 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 languageEnglish (US)
Pages (from-to)38-43
Number of pages6
JournalProceedings of the International Workshop on Rapid System Prototyping
StatePublished - Jan 1 1999

Fingerprint Dive into the research topics of '3-D floorplanning: simulated annealing and greedy placement methods for reconfigurable computing systems'. Together they form a unique fingerprint.

Cite this