Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

FPL
2006
Springer

favoriteEmaildiscussreport

115views Hardware» more FPL 2006»

A Congestion Driven Placement Algorithm for FPGA Synthesis

13 years 8 months ago

A Congestion Driven Placement Algorithm for FPGA Synthesis

Download www.cse.unt.edu

We introduce a new congestion driven placement algorithm for FPGAs in which the overlappingeffect of boundingboxes is taken into consideration. Experimental results show that compared with the linear congestion method [1] used in the state-of-the-art FPGA place and route package VPR [2], our algorithm achieves channel width reduction on 70% of the 20 largest MCNC benchmark circuits (10.1% on average) while keeping the channel width of the remaining 30% benchmarks unchanged. A distinct feature of our algorithm is that the critical path delay is not elongated on average, and in most cases reduced.

Yue Zhuo, Hao Li, Saraju P. Mohanty

Real-time Traffic

Algorithm Achieves Channel | Channel Width | Congestion Driven Placement | FPL 2006 | Hardware |

claim paper

Related Content

» New timing and routability driven placement algorithms for FPGA synthesis

» Congestion Aware Layout Driven Logic Synthesis

» ArchitectureAdaptive RoutabilityDriven Placement for FPGAs

» Power and Delay Reduction via Simultaneous Logic and Placement Optimization in FPGAs

» RUMBLE An Incremental TimingDriven PhysicalSynthesis Optimization Algorithm

» An evolutionary approach to timing driven FPGA placement

» OnLine Synthesis for Partially Reconfigurable FPGAs

» Automated synthesis for asynchronous FPGAs

» Simultaneous Timing Driven Clustering and Placement for FPGAs

Post Info
More Details (n/a)

Added	22 Aug 2010
Updated	22 Aug 2010
Type	Conference
Year	2006
Where	FPL
Authors	Yue Zhuo, Hao Li, Saraju P. Mohanty

Comments (0)