Fast decap allocation based on algebraic multigrid

Decap (decoupling capacitor) is an effective technique for suppressing power supply noise. Nevertheless, over-usage of decap usually causes excessive power dissipation. Therefore, the total decap area needs to be minimized subject to power supply noise constraints. This is a complicated nonlinear op...

Full description

Saved in:
Bibliographic Details
Published inInternational Conference on Computer Aided Design: Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design : San Jose, California; 05-09 Nov. 2006 pp. 107 - 111
Main Authors Zhuo, Cheng, Hu, Jiang, Zhao, Min, Chen, Kangsheng
Format Conference Proceeding
LanguageEnglish
Published 05.11.2006
Online AccessGet full text
ISBN1595933891
9781595933898
ISSN1092-3152
DOI10.1145/1233501.1233525

Cover

More Information
Summary:Decap (decoupling capacitor) is an effective technique for suppressing power supply noise. Nevertheless, over-usage of decap usually causes excessive power dissipation. Therefore, the total decap area needs to be minimized subject to power supply noise constraints. This is a complicated nonlinear optimization problem that may have as many as millions of variables. We propose an algebraic multigrid (AMG) based method to handle the high complexity. An error compensation scheme is developed to compensate the accuracy loss during the AMG reduction. A charge based back-mapping method and a few other techniques are suggested to further improve the computation efficiency. Our method is flexible to use and can be easily integrated with other existing decap allocation works. When compared to several previous works, the results from our method are usually the closest to the optimum. Our method also runs fast and can solve circuits with up to 1 million nodes in about 11 minutes. In addition, it has better scalability than the previous works.
Bibliography:SourceType-Conference Papers & Proceedings-1
ObjectType-Conference Paper-1
content type line 25
ISBN:1595933891
9781595933898
ISSN:1092-3152
DOI:10.1145/1233501.1233525