Fast template placement for reconfigurable computing systems

Kiarash Bazargan; Ryan Kastner; Majid Sarrafzadeh

doi:10.1109/54.825678

Fast template placement for reconfigurable computing systems

Kiarash Bazargan, Ryan Kastner, Majid Sarrafzadeh

Electrical and Computer Engineering

Research output: Contribution to journal › Article › peer-review

272 Scopus citations

Abstract

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 language	English (US)
Pages (from-to)	68-83
Number of pages	16
Journal	IEEE Design and Test of Computers
Volume	17
Issue number	1
DOIs	https://doi.org/10.1109/54.825678
State	Published - 2000

Bibliographical note

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

Access

10.1109/54.825678

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

Cite this

@article{a4eace7202514b6aa3302d7e9e155fd5,

title = "Fast template placement for reconfigurable computing systems",

abstract = "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.",

author = "Kiarash Bazargan and Ryan Kastner and Majid Sarrafzadeh",

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

year = "2000",

doi = "10.1109/54.825678",

language = "English (US)",

volume = "17",

pages = "68--83",

journal = "IEEE Design and Test",

issn = "2168-2356",

publisher = "IEEE Computer Society",

number = "1",

}

TY - JOUR

T1 - Fast template placement for reconfigurable computing systems

AU - Bazargan, Kiarash

AU - Kastner, Ryan

AU - Sarrafzadeh, Majid

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

PY - 2000

Y1 - 2000

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0033891806&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033891806&partnerID=8YFLogxK

U2 - 10.1109/54.825678

DO - 10.1109/54.825678

M3 - Article

AN - SCOPUS:0033891806

VL - 17

SP - 68

EP - 83

JO - IEEE Design and Test

JF - IEEE Design and Test

SN - 2168-2356

IS - 1

ER -

Fast template placement for reconfigurable computing systems

Abstract

Bibliographical note

Access

Other files and links

Cite this