loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
IEEE Computer Society Annual Symposium on VLSI: Emerging Trends in VLSI Systems Design (ISVLSI'04)
Force-Directed Performance-Driven Placement Algorithm for FPGAs
Lafayette, Louisiana
February 19-February 20
ISBN: 0-7695-2097-9
Hao Li, University of South Florida
Wai-Kei Mak, University of South Florida
Srinivas Katkoori, University of South Florida
We propose a net-based force-directed performance-driven placement algorithm for hierarchical FPGAs. The input netlist is first transformed into a net dependency graph. Then we partition this graph into clusters and a net-cluster level floorplan is derived by simulated annealing. Force-directed net placement is performed to generate a coarse net-level placement. Next, a force-directed logic cell placement is computed iteratively. Finally, we assign I/O pins using a modified Munkres' algorithm. The main contribution of our work is that we apply force-directed method in hierarchical FPGAs to improve delay as compared to Xilinx Tools. We improve the post-layout delay and average connection delay by an average of 10.2% and 19.3% respectively over a set MCNC Combinational benchmarks. We also improve the maximum clock frequency by an average of 20.7% over a set of MCNC sequential circuits.
Citation:
Hao Li, Wai-Kei Mak, Srinivas Katkoori, "Force-Directed Performance-Driven Placement Algorithm for FPGAs," isvlsi, pp.193, IEEE Computer Society Annual Symposium on VLSI: Emerging Trends in VLSI Systems Design (ISVLSI'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.