Net length based routability driven packing

Audip Pandit, Ali Akoglu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

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.

Original languageEnglish (US)
Title of host publicationICFPT 2007 - International Conference on Field Programmable Technology
Pages225-232
Number of pages8
DOIs
StatePublished - 2007
EventInternational Conference on Field Programmable Technology, ICFPT 2007 - Kitakyushu, Japan
Duration: Dec 12 2007Dec 14 2007

Other

OtherInternational Conference on Field Programmable Technology, ICFPT 2007
CountryJapan
CityKitakyushu
Period12/12/0712/14/07

Fingerprint

Clustering algorithms
Field programmable gate arrays (FPGA)
Computer aided design

ASJC Scopus subject areas

  • Hardware and Architecture
  • Electrical and Electronic Engineering

Cite this

Pandit, A., & Akoglu, A. (2007). Net length based routability driven packing. In ICFPT 2007 - International Conference on Field Programmable Technology (pp. 225-232). [4439253] https://doi.org/10.1109/FPT.2007.4439253

Net length based routability driven packing. / Pandit, Audip; Akoglu, Ali.

ICFPT 2007 - International Conference on Field Programmable Technology. 2007. p. 225-232 4439253.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Pandit, A & Akoglu, A 2007, Net length based routability driven packing. in ICFPT 2007 - International Conference on Field Programmable Technology., 4439253, pp. 225-232, International Conference on Field Programmable Technology, ICFPT 2007, Kitakyushu, Japan, 12/12/07. https://doi.org/10.1109/FPT.2007.4439253
Pandit A, Akoglu A. Net length based routability driven packing. In ICFPT 2007 - International Conference on Field Programmable Technology. 2007. p. 225-232. 4439253 https://doi.org/10.1109/FPT.2007.4439253
Pandit, Audip ; Akoglu, Ali. / Net length based routability driven packing. ICFPT 2007 - International Conference on Field Programmable Technology. 2007. pp. 225-232
@inproceedings{f645ed67a1da4c5cb0b9f9967db9dbd5,
title = "Net length based routability driven packing",
abstract = "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.",
author = "Audip Pandit and Ali Akoglu",
year = "2007",
doi = "10.1109/FPT.2007.4439253",
language = "English (US)",
isbn = "1424414725",
pages = "225--232",
booktitle = "ICFPT 2007 - International Conference on Field Programmable Technology",

}

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

SN - 1424414725

SN - 9781424414727

SP - 225

EP - 232

BT - ICFPT 2007 - International Conference on Field Programmable Technology

ER -