An Improved Diffusion Based Placement Algorithm for Reducing Interconnect Demand in Congested Regions of FPGAs

Abstract EN

An FPGA has a finite routing capacity due to which a fair number of highly dense circuits fail to map on slightly underresourced architecture.

The high-interconnect demand in the congested regions is not met by the available resources as a result of which the circuit becomes unroutable for that particular architecture.

In this paper, we present a new placement approach which is based on a natural process called diffusion.

Our placer attempts to minimize the routing congestion by evenly disseminating the interconnect demand across an FPGA chip.

For the 20 MCNC benchmark circuits, our algorithm reduced the channel width for 15 circuits.

The results showed on average ~33% reduction in standard deviation of interconnect usage at an expense of an average ~13% penalty on critical path delay.

Maximum channel width gain of ~33% was also observed.