Block Constraints Budgeting in Timing-Driven Hierarchical Flow - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2004

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.
Fichier principal
Vignette du fichier
930-35.pdf (133.63 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

lirmm-00108941 , version 1 (21-01-2017)

Identifiers

  • HAL Id : lirmm-00108941 , version 1

Cite

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⟩
211 View
676 Download

Share

Gmail Facebook X LinkedIn More