Learning Based Timing Closure on Relative Timed Design - VLSI-SoC: Design Trends Access content directly
Conference Papers Year : 2021

Learning Based Timing Closure on Relative Timed Design

Tannu Sharma
  • Function : Author
  • PersonId : 1158067
Kenneth S. Stevens
  • Function : Author
  • PersonId : 1007219

Abstract

Relative timed circuits leverage formal timing specifications to design and optimize integrated circuits. Relative timing can be applied to specify design correctness and performance properties of digital circuits in the form of a set of timing constraints. These circuits often show significant performance and power advantages over other approaches, but require assistance to automate timing driven synthesis and place and route in commercial electronic design automation (EDA) tools. A machine learning based automatic timing closure solution for relative timed circuits is presented. The machine learning implementation is expected to speed-up the process by learning from the features during each iteration, minimizing the overall run-time to timing close a design. A comparative study between regression model based and gradient boosting tree based solutions with an algorithmic approach is presented. Power and performance of the circuits are improved while reducing overall run-time required to timing close a relative timed design with commercial EDA tools.
Fichier principal
Vignette du fichier
512096_1_En_7_Chapter.pdf (274.88 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03759728 , version 1 (24-08-2022)

Licence

Attribution

Identifiers

Cite

Tannu Sharma, Sumanth Kolluru, Kenneth S. Stevens. Learning Based Timing Closure on Relative Timed Design. 28th IFIP/IEEE International Conference on Very Large Scale Integration - System on a Chip (VLSI-SoC), Oct 2020, Salt Lake City, UT, United States. pp.133-148, ⟨10.1007/978-3-030-81641-4_7⟩. ⟨hal-03759728⟩
29 View
5 Download

Altmetric

Share

Gmail Facebook X LinkedIn More