Speeding Up FPGA Placement via Partitioning and Multithreading
One of the current main challenges of the FPGA design flow is the long processing time of the placement and routing algorithms. In this paper, we propose a hybrid parallelization technique of the simulated annealing-based placement algorithm of VPR developed in the work of Betz and Rose (1997). The...
Saved in:
Main Author: | Cristinel Ababei |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2009-01-01
|
Series: | International Journal of Reconfigurable Computing |
Online Access: | http://dx.doi.org/10.1155/2009/514754 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Multi-FPGA Partitioning Method Based on Topological Levelization
by: Nabil Kerkiz, et al.
Published: (2010-01-01) -
Impact of Dual Placement and Routing on WDDL Netlist Security in FPGA
by: Emna Amouri, et al.
Published: (2013-01-01) -
3D Network-on-Chip Architectures Using Homogeneous Meshes and Heterogeneous Floorplans
by: Vitor de Paulo, et al.
Published: (2010-01-01) -
New Three-Level Resource Management Enhancing Quality of Offline Hardware Task Placement on FPGA
by: Ikbel Belaid, et al.
Published: (2010-01-01) -
A Dynamically Reconfigured Multi-FPGA Network Platform for High-Speed Malware Collection
by: Sascha Mühlbach, et al.
Published: (2012-01-01)