A Unified Theory of Timing Budget Management

Ghiasi, Soheil; Bozorgzadeh, Eli; Huang, Po-Kuan; Jafari, Roozbeh; Sarrafzadeh, Majid

doi:10.1109/tcad.2006.873901

Cited by 19 publications

(1 citation statement)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…sensitive transitive closure graph. In [10] and [11], authors proposed combinatorial methods based on net flow approach to handle the slack budget problem. Budgeting problem can be extended to describe exactly realword applications, such as gate resizing, multiple V dd and multiple V th assignment [12][13] [14].…”

Section: Introductionmentioning

confidence: 99%

Network flow-based simultaneous retiming and slack budgeting for low power design

Yu¹,

Dong²,

Ma³

et al. 2011

16th Asia and South Pacific Design Automation Conference (ASP-DAC 2011)

View full text Add to dashboard Cite

Abstract-Low power design has become one of the most significant requirements when CMOS technology entered the nanometer era. Therefore, timing budget is often performed to slow down as many components as possible so that timing slacks can be applied to reduce the power consumption while maintaining the performance of the whole design. Retiming is a procedure that involves the relocation of flip-flops (FFs) across logic gates to achieve faster clocking speed. In this paper we show that the retiming and slack budgeting problem can be formulated to a convex cost dual network flow problem. Both the theoretical analysis and experimental results show the efficiency of our approach which can not only reduce power consumption but also speedup previous work.

show abstract

Section: Introductionmentioning

confidence: 99%