A flexibility aware budgeting for hierarchical flow timing closure

Authors:
O. Omedes;M. Robert;M. Ramdani
Affiliations:
Cadence Design Syst., Inc., San Jose, CA, USA;Dept. of ECE, Northwestern Univ., Evanston, IL, USA;Dept. of ECE, Northwestern Univ., Evanston, IL, USA
Venue:
Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design
Year:
2004

Citing 5
Cited 1

Iterative and adaptive slack allocation for performance-driven layout and FPGA routing

DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
Logical effort: designing fast CMOS circuits

Logical effort: designing fast CMOS circuits
Delay budgeting for a timing-closure-driven design method

Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
Hybrid hierarchical timing closure methodology for a high performance and low power DSP

Proceedings of the 40th annual Design Automation Conference
A delay budgeting algorithm ensuring maximum flexibility in placement

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Bounded potential slack: enabling time budgeting for dual-Vt allocation of hierarchical design

Proceedings of the 2010 Asia and South Pacific Design Automation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new block budgeting algorithm which speeds up timing closure in timing driven hierarchical 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.