Fast online placement for reconfigurable computing systems

K. Bazargan, M. Sarrafzadeh

Research output: Contribution to journalConference articlepeer-review

14 Scopus citations


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 issue is the placement of the modules on the reconfigurable functional unit (RFU). In this paper we present an online heuristic placement method with overall O(n log n) space complexity and O(log n) time complexity for each insertion/deletion of modules on the RFU chip, n being the number of modules currently on the RFU. Our proposed method is O(n) faster than an algorithm which considers all possible locations for placing a new module, but as experimental results show its quality is 7% worse.

Original languageEnglish (US)
Pages (from-to)300-302
Number of pages3
JournalIEEE Symposium on FPGAs for Custom Computing Machines, Proceedings
StatePublished - 1999
EventProceedings of the 7th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCMM 1999) - Napa Valley, CA, United States
Duration: Apr 21 1999Apr 23 1999


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

Cite this