Concurrent timing based and routability driven depopulation technique for FPGA packing

Audip Pandit, Lakshmi Easwaran, Ali Akoglu

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

4 Citations (Scopus)

Abstract

In FPGA CAD flow, routability driven algorithms have been introduced to improve feasibility of mapping designs onto the underlying architecture; timing and power driven algorithms have been introduced to meet design specifications. A number of techniques have been proposed to tackle routability, timing or power objectives independently during clustering stage. However, there is minimal work that targets multiple optimization goals. In this paper, we evaluate a clustering technique that targets routability and timing goals simultaneously. We combine the timing-driven T-VPack algorithm with a routability-driven non-uniform depopulation scheme (T-RDPack). Our technique keeps clusters on the critical path fully populated, while depopulating other clusters in the design. This approach has been implemented into the Versatile Place and Route (VPR) toolset. We show that, compared to T-VPack, channel width reductions of 11.5%, 19.1%, 24.7% are achieved while incurring an area overhead of 0.6%, 3.1%, 9.1% respectively with negligible increase in critical path delay, exceeding the performance of T-RPack.

Original languageEnglish (US)
Title of host publicationProceedings of the 2008 International Conference on Field-Programmable Technology, ICFPT 2008
Pages325-328
Number of pages4
DOIs
StatePublished - 2008
Event2008 International Conference on Field-Programmable Technology, ICFPT 2008 - Taipei, Taiwan, Province of China
Duration: Dec 7 2008Dec 10 2008

Other

Other2008 International Conference on Field-Programmable Technology, ICFPT 2008
CountryTaiwan, Province of China
CityTaipei
Period12/7/0812/10/08

Fingerprint

Field programmable gate arrays (FPGA)
Computer aided design
Specifications

ASJC Scopus subject areas

  • Computer Science Applications
  • Hardware and Architecture

Cite this

Pandit, A., Easwaran, L., & Akoglu, A. (2008). Concurrent timing based and routability driven depopulation technique for FPGA packing. In Proceedings of the 2008 International Conference on Field-Programmable Technology, ICFPT 2008 (pp. 325-328). [4762409] https://doi.org/10.1109/FPT.2008.4762409

Concurrent timing based and routability driven depopulation technique for FPGA packing. / Pandit, Audip; Easwaran, Lakshmi; Akoglu, Ali.

Proceedings of the 2008 International Conference on Field-Programmable Technology, ICFPT 2008. 2008. p. 325-328 4762409.

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

Pandit, A, Easwaran, L & Akoglu, A 2008, Concurrent timing based and routability driven depopulation technique for FPGA packing. in Proceedings of the 2008 International Conference on Field-Programmable Technology, ICFPT 2008., 4762409, pp. 325-328, 2008 International Conference on Field-Programmable Technology, ICFPT 2008, Taipei, Taiwan, Province of China, 12/7/08. https://doi.org/10.1109/FPT.2008.4762409
Pandit A, Easwaran L, Akoglu A. Concurrent timing based and routability driven depopulation technique for FPGA packing. In Proceedings of the 2008 International Conference on Field-Programmable Technology, ICFPT 2008. 2008. p. 325-328. 4762409 https://doi.org/10.1109/FPT.2008.4762409
Pandit, Audip ; Easwaran, Lakshmi ; Akoglu, Ali. / Concurrent timing based and routability driven depopulation technique for FPGA packing. Proceedings of the 2008 International Conference on Field-Programmable Technology, ICFPT 2008. 2008. pp. 325-328
@inproceedings{566e7e2f19b94c6ea76ab8110ea8833f,
title = "Concurrent timing based and routability driven depopulation technique for FPGA packing",
abstract = "In FPGA CAD flow, routability driven algorithms have been introduced to improve feasibility of mapping designs onto the underlying architecture; timing and power driven algorithms have been introduced to meet design specifications. A number of techniques have been proposed to tackle routability, timing or power objectives independently during clustering stage. However, there is minimal work that targets multiple optimization goals. In this paper, we evaluate a clustering technique that targets routability and timing goals simultaneously. We combine the timing-driven T-VPack algorithm with a routability-driven non-uniform depopulation scheme (T-RDPack). Our technique keeps clusters on the critical path fully populated, while depopulating other clusters in the design. This approach has been implemented into the Versatile Place and Route (VPR) toolset. We show that, compared to T-VPack, channel width reductions of 11.5{\%}, 19.1{\%}, 24.7{\%} are achieved while incurring an area overhead of 0.6{\%}, 3.1{\%}, 9.1{\%} respectively with negligible increase in critical path delay, exceeding the performance of T-RPack.",
author = "Audip Pandit and Lakshmi Easwaran and Ali Akoglu",
year = "2008",
doi = "10.1109/FPT.2008.4762409",
language = "English (US)",
isbn = "9781424427963",
pages = "325--328",
booktitle = "Proceedings of the 2008 International Conference on Field-Programmable Technology, ICFPT 2008",

}

TY - GEN

T1 - Concurrent timing based and routability driven depopulation technique for FPGA packing

AU - Pandit, Audip

AU - Easwaran, Lakshmi

AU - Akoglu, Ali

PY - 2008

Y1 - 2008

N2 - In FPGA CAD flow, routability driven algorithms have been introduced to improve feasibility of mapping designs onto the underlying architecture; timing and power driven algorithms have been introduced to meet design specifications. A number of techniques have been proposed to tackle routability, timing or power objectives independently during clustering stage. However, there is minimal work that targets multiple optimization goals. In this paper, we evaluate a clustering technique that targets routability and timing goals simultaneously. We combine the timing-driven T-VPack algorithm with a routability-driven non-uniform depopulation scheme (T-RDPack). Our technique keeps clusters on the critical path fully populated, while depopulating other clusters in the design. This approach has been implemented into the Versatile Place and Route (VPR) toolset. We show that, compared to T-VPack, channel width reductions of 11.5%, 19.1%, 24.7% are achieved while incurring an area overhead of 0.6%, 3.1%, 9.1% respectively with negligible increase in critical path delay, exceeding the performance of T-RPack.

AB - In FPGA CAD flow, routability driven algorithms have been introduced to improve feasibility of mapping designs onto the underlying architecture; timing and power driven algorithms have been introduced to meet design specifications. A number of techniques have been proposed to tackle routability, timing or power objectives independently during clustering stage. However, there is minimal work that targets multiple optimization goals. In this paper, we evaluate a clustering technique that targets routability and timing goals simultaneously. We combine the timing-driven T-VPack algorithm with a routability-driven non-uniform depopulation scheme (T-RDPack). Our technique keeps clusters on the critical path fully populated, while depopulating other clusters in the design. This approach has been implemented into the Versatile Place and Route (VPR) toolset. We show that, compared to T-VPack, channel width reductions of 11.5%, 19.1%, 24.7% are achieved while incurring an area overhead of 0.6%, 3.1%, 9.1% respectively with negligible increase in critical path delay, exceeding the performance of T-RPack.

UR - http://www.scopus.com/inward/record.url?scp=63049104758&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=63049104758&partnerID=8YFLogxK

U2 - 10.1109/FPT.2008.4762409

DO - 10.1109/FPT.2008.4762409

M3 - Conference contribution

AN - SCOPUS:63049104758

SN - 9781424427963

SP - 325

EP - 328

BT - Proceedings of the 2008 International Conference on Field-Programmable Technology, ICFPT 2008

ER -