A General Graph Based Pessimism Reduction Framework For Design Optimization Of Timing Closure

Simple item page
dc.contributor.authorPeng, F.
dc.contributor.authorYan, C.
dc.contributor.authorFeng, C.
dc.contributor.authorZheng, J.
dc.contributor.authorWang, S. -G
dc.contributor.authorZhou, Dian
dc.contributor.authorZeng, X.
dc.contributor.utdAuthorZhou, Dian
dc.date.accessioned2019-07-11T22:52:56Z
dc.date.available2019-07-11T22:52:56Z
dc.date.created2018-06-24
dc.descriptionFull text access from Treasures at UT Dallas is restricted to current UTD affiliates (use the provided Link to Article). Non UTD affiliates will find the web address for this item by clicking the "Show full item record" link, copying the "dc.relation.uri" metadata and pasting it into a browser.
dc.description.abstractIn this paper, we develop a general pessimism reduction framework for design optimization of timing closure. Although the modified graph based timing analysis (mGBA) slack model can be readily formulated into a quadratic programming problem with constraints, the realistic difficulty is the size of the problem. A critical path selection scheme, a uniform sampling method with the sparse characteristics of the optimal solution, and a stochastic conjugate gradient method are proposed to accelerate the optimization solver. This modified GBA is embedded into design optimization of timing closure. Experimental results show that the proposed solver can achieve 13.82x speedup than gradient descent method with similar accuracy. With mGBA, the optimization of timing closure can achieve a better performance on area, leakage power, buffer counts.
dc.description.departmentErik Jonsson School of Engineering and Computer Science
dc.description.sponsorshipNational Key Research and Development Program of China 2016YFB0201304, National Major Science and Technology Special Project of China (2017ZX01028101-003), National Natural Science Foundation of China (NSFC) research projects 61674042, 61574046, 61574044, 61774045, and 61628402. NSF Grant 1115564.
dc.identifier.bibliographicCitationPeng, F., C. Yan, C. Feng, J. Zheng, et al. 2018. "A general graph based pessimism reduction framework for design optimization of timing closure." Proceedings - Design Automation Conference, 55 vol.137710: art. 25, doi:.10.1145/3195970.3195973
dc.identifier.issn0738100X; 9781450357005 (ISBN)
dc.identifier.urihttps://hdl.handle.net/10735.1/6681
dc.identifier.volume137710
dc.language.isoen
dc.publisherACM
dc.relation.isPartOfProceedings - Design Automation Conference, 55
dc.relation.urihttp://dx.doi.org/10.1145/3195970.3195973
dc.rights©2018 Association for Computing Machinery
dc.subjectComputer-aided design
dc.subjectGraphic methods
dc.subjectQuadratic programming
dc.subjectStochastic systems
dc.subjectTiming circuits
dc.subjectConjugate gradient methods
dc.titleA General Graph Based Pessimism Reduction Framework For Design Optimization Of Timing Closure
dc.type.genrearticle

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
JECS-6680-279794.75-LINK.pdf
Size:
164.82 KB
Format:
Adobe Portable Document Format
Description:
Link to Article
Download

Collections

Zhou, Dian