A Hybrid Technique for Discrete Gate Sizing Based on Lagrangian Relaxation

作者：Livramento Vinicius S^*; Guth Chrystian; Guentzel Jose Luis; Johann Marcelo O

来源：ACM Transactions on Design Automation of Electronic Systems, 2014, 19(4): 40.

DOI：10.1145/2647956

• Design
• Algorithms
• Performance
• Electronic design automation (EDA)
• discrete gate sizing
• leakage power
• hybrid technique
• Lagrangian relaxation
• greedy heuristic

Discrete gate sizing has attracted a lot of attention recently as the EDA industry faces the challenge of optimizing large standard cell-based circuits. The discrete nature of the problem, along with complex timing models, stringent design constraints, and ever-increasing circuit sizes, make the problem very difficult to tackle. Lagrangian Relaxation (LR) is an effective technique to handle complex constrained optimization problems and therefore has been successfully applied to solve the gate sizing problem. This article proposes an improved Lagrangian relaxation formulation for discrete gate sizing that relaxes timing, maximum gate input slew, and maximum gate output capacitance constraints. Based on such formulation, we propose a hybrid technique composed of three steps. First, a topological greedy heuristic solves the LR formulation. Such a heuristic is applied assuming a slightly increased target clock period (backoff factor) to better explore the solution space. Second, a delay recovery heuristic reestablishes the original target clock with small power overhead. Third, a power recovery heuristic explores the remaining slacks to further reduce power. Experiments on the ISPD 2012 Contest benchmarks show that our hybrid technique provides less leakage power than the state-of-the-art work for every circuit from the ISPD 2012 Contest infrastructure, achieving up to 24% less leakage. In addition, our technique achieves a much better compromise between leakage reduction and runtime, obtaining, on average, 9% less leakage power while running 8.8 times faster.

• 出版日期2014-8