TY - GEN
T1 - Net length based routability driven packing
AU - Pandit, Audip
AU - Akoglu, Ali
PY - 2007
Y1 - 2007
N2 - FPGA CAD requires routability driven algorithms to improve feasibility of mapping designs onto the underlying architecture. At the clustering stage, routability enhancing parameters such as number of absorbed pins, absorbed nets, criticality, connectivity, and number of net terminals have been identified. We argue that net length is an important parameter not explored in this context. In this paper, we show a structural approach to predict individual net lengths based on the Intrinsic Shortest Path Length (ISPL) metric, and use it to reduce track count achieved by previous clustering algorithms. For the set of 20 large MCNC benchmarks, we achieve an average channel width reduction of 3.25 tracks with no area overhead compared to previous approaches. The prediction mechanism and modified clustering algorithm have been incorporated into the VPack/VPR (Versatile Place and Route) toolset. This is a first approach that applies apriori net length predictions within the clustering stage to optimize a design for routability.
AB - FPGA CAD requires routability driven algorithms to improve feasibility of mapping designs onto the underlying architecture. At the clustering stage, routability enhancing parameters such as number of absorbed pins, absorbed nets, criticality, connectivity, and number of net terminals have been identified. We argue that net length is an important parameter not explored in this context. In this paper, we show a structural approach to predict individual net lengths based on the Intrinsic Shortest Path Length (ISPL) metric, and use it to reduce track count achieved by previous clustering algorithms. For the set of 20 large MCNC benchmarks, we achieve an average channel width reduction of 3.25 tracks with no area overhead compared to previous approaches. The prediction mechanism and modified clustering algorithm have been incorporated into the VPack/VPR (Versatile Place and Route) toolset. This is a first approach that applies apriori net length predictions within the clustering stage to optimize a design for routability.
UR - http://www.scopus.com/inward/record.url?scp=50149113285&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=50149113285&partnerID=8YFLogxK
U2 - 10.1109/FPT.2007.4439253
DO - 10.1109/FPT.2007.4439253
M3 - Conference contribution
AN - SCOPUS:50149113285
SN - 1424414725
SN - 9781424414727
T3 - ICFPT 2007 - International Conference on Field Programmable Technology
SP - 225
EP - 232
BT - ICFPT 2007 - International Conference on Field Programmable Technology
T2 - International Conference on Field Programmable Technology, ICFPT 2007
Y2 - 12 December 2007 through 14 December 2007
ER -