Robust algorithms for area and power optimization of digital integrated circuits under variability
| dc.contributor.advisor | Orshansky, Michael | en |
| dc.creator | Mani, Murari, 1981- | en |
| dc.date.accessioned | 2012-10-05T14:35:22Z | en |
| dc.date.accessioned | 2017-05-11T22:28:10Z | |
| dc.date.available | 2012-10-05T14:35:22Z | en |
| dc.date.available | 2017-05-11T22:28:10Z | |
| dc.date.issued | 2008-12 | en |
| dc.description | text | en |
| dc.description.abstract | As device geometries shrink, variability of process parameters becomes pronounced, resulting in a significant impact on the power and timing performance of integrated circuits. Deterministic optimization algorithms for power and area lack capabilities for handling uncertainty, and may lead to over-conservative solutions. As a result, there is an increasing need for statistical algorithms that can take into account the probabilistic nature of process parameters. Statistical optimization techniques however suffer from the limitation of high computational complexity. The objective of this work is to develop efficient algorithms for optimization of area and power under process variability while guaranteeing high yield. The first half of the dissertation focuses on two design-time techniques: (i) a gate sizing approach for area minimization under timing variability; (ii) an algorithm for total power minimization considering variability in timing and power. Design-time methods impose an overhead on each instance of the fabricated chip since they lack the ability to react to the actual conditions on the chip. In the second half of the dissertation we develop joint design-time and post-silicon co-optimization techniques which are superior to design-time only optimization methods. Specifically, we develop (i) a methodology for optimization of leakage power using design-time sizing and post silicon tuning using adaptive body bias; (ii) an optimization technique to minimize the total power of a buffer chain while considering the finite nature of adaptability afforded. The developed algorithms effectively improve the overconservatism of the corner-based deterministic algorithms and permit us to target a specified yield level accurately. As the magnitude of variability increases, it is expected that statistical algorithms will become increasingly important in future technology generations. | en |
| dc.description.department | Electrical and Computer Engineering | en |
| dc.format.medium | electronic | en |
| dc.identifier.uri | http://hdl.handle.net/2152/18182 | en |
| dc.language.iso | eng | en |
| dc.rights | Copyright is held by the author. Presentation of this material on the Libraries' web site by University Libraries, The University of Texas at Austin was made possible under a limited license grant from the author who has retained all copyrights in the works. | en |
| dc.subject.lcsh | Mathematical optimization | en |
| dc.subject.lcsh | Digital integrated circuits--Design and construction | en |
| dc.subject.lcsh | Linear programming | en |
| dc.subject.lcsh | Algorithms | en |
| dc.title | Robust algorithms for area and power optimization of digital integrated circuits under variability | en |