Block Constraints Budgeting in Timing-Driven Hierarchical Flow

Abstract : In this paper, we introduce a new block budgeting algorithm that speeds up timing closure in timing driven hier- archical flows. After a brief description of the addressed flow, block budgeting challenges are detailed. Then, we explain why existing budgeting approaches are not adapted to fulfil these challenges. A new block budgeting algorithm is proposed. In order to derive relevant block constraints, this algorithm analyzes the design flexibility. This Flexibility Aware Budgeting (FAB) approach is then compared to some previous ones. Experiments based on commercial EDA tools and real designs show up to 55 % reduction in hierarchical flow run time and lead to a good flow timing closure.
Complete list of metadatas

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00108941
Contributor : Christine Carvalho de Matos <>
Submitted on : Saturday, January 21, 2017 - 7:55:36 PM
Last modification on : Wednesday, December 19, 2018 - 3:26:05 PM
Long-term archiving on : Saturday, April 22, 2017 - 1:00:18 PM

File

930-35.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : lirmm-00108941, version 1

Citation

Olivier Omedes, Michel Robert, Mohamed Ramdani. Block Constraints Budgeting in Timing-Driven Hierarchical Flow. DCIS: Design of Circuits and Integrated Systems, Nov 2004, Bordeaux, France. pp.930-935. ⟨lirmm-00108941⟩

Share

Metrics

Record views

300

Files downloads

286