Fast template placement for reconfigurable computing systems

Kiarash Bazargan, Ryan Kastner, Majid Sarrafzadeh

Research output: Contribution to journalArticlepeer-review

279 Scopus citations


An account is given on the results of previous work on floorplanning for reconfigurable systems. It is shown why it is important to deal with both online and offline placement algorithms. For the online problem, a class of fast, but not optimal and a slow, but high-quality placement algorithm, is presented. For the offline problem, simulated annealing and greedy placement methods are devised for the 3D placement of the RFUOPs.

Original languageEnglish (US)
Pages (from-to)68-83
Number of pages16
JournalIEEE Design and Test of Computers
Issue number1
StatePublished - 2000

Bibliographical note

Funding Information:
This work was supported by DARPA under contract number DABT63-97-C-0035.


Dive into the research topics of 'Fast template placement for reconfigurable computing systems'. Together they form a unique fingerprint.

Cite this