File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: The approximation scheme for peak power driven voltage partitioning

TitleThe approximation scheme for peak power driven voltage partitioning
Authors
KeywordsFully Polynomial Time Approximation Scheme
NP-Complete
Peak Power Minimization
Voltage Island Shutdown
Voltage Partitioning
Issue Date2011
Citation
IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD, 2011, p. 736-741 How to Cite?
AbstractWith advancing technology, large dynamic power consumption has significantly limited circuit miniaturization. Minimizing peak power consumption, which is defined as the maximum power consumption among all voltage partitions, is important since it enables energy saving from the voltage island shutdown mechanism. In this paper, we prove that the peak power driven voltage partitioning problem is NP-complete and propose an efficient provably good fully polynomial time approximation scheme for it. The new algorithm can approximate the optimal peak power driven voltage partitioning solution in O(m 2 (mn/ 4)) time within a factor of (1 ) for sufficiently small positive e, where n is the number of circuit blocks and m is the number of partitions which is a small constant in practice. Our experimental results demonstrate that the dynamic programming cannot finish for even 20 blocks while our new approximation algorithm runs fast. In particular, varying e, orders of magnitude speedup can be obtained with only 0.6% power increase. The tradeoff between the peak power minimization and the total power minimization is also investigated. We demonstrate that the total power minimization algorithm obtains good results in total power but with quite large peak power, while our peak power optimization algorithm can achieve on average 26.5% reduction in peak power with only 0.46% increase in total power. Moreover, our peak power driven voltage partitioning algorithm is integrated into a simulated annealing based floorplanning technique. Experimental results demonstrate that compared to total power driven floorplanning, the peak power driven floorplanning can significantly reduce peak power with only little impact in total power, HPWL, estimated power ground routing cost, level shifter cost and runtime. Further, when the voltage island shutdown is performed, peak power driven voltage partitioning can lead to over 10% more energy saving than a greedy frequency based voltage partitioning when multiple idle block sequences are considered. © 2011 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/336101
ISSN
2023 SCImago Journal Rankings: 0.894

 

DC FieldValueLanguage
dc.contributor.authorWang, Jia-
dc.contributor.authorChen, Xiaodao-
dc.contributor.authorLiao, Chen-
dc.contributor.authorHu, Shiyan-
dc.date.accessioned2024-01-15T08:23:28Z-
dc.date.available2024-01-15T08:23:28Z-
dc.date.issued2011-
dc.identifier.citationIEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD, 2011, p. 736-741-
dc.identifier.issn1092-3152-
dc.identifier.urihttp://hdl.handle.net/10722/336101-
dc.description.abstractWith advancing technology, large dynamic power consumption has significantly limited circuit miniaturization. Minimizing peak power consumption, which is defined as the maximum power consumption among all voltage partitions, is important since it enables energy saving from the voltage island shutdown mechanism. In this paper, we prove that the peak power driven voltage partitioning problem is NP-complete and propose an efficient provably good fully polynomial time approximation scheme for it. The new algorithm can approximate the optimal peak power driven voltage partitioning solution in O(m 2 (mn/ 4)) time within a factor of (1 ) for sufficiently small positive e, where n is the number of circuit blocks and m is the number of partitions which is a small constant in practice. Our experimental results demonstrate that the dynamic programming cannot finish for even 20 blocks while our new approximation algorithm runs fast. In particular, varying e, orders of magnitude speedup can be obtained with only 0.6% power increase. The tradeoff between the peak power minimization and the total power minimization is also investigated. We demonstrate that the total power minimization algorithm obtains good results in total power but with quite large peak power, while our peak power optimization algorithm can achieve on average 26.5% reduction in peak power with only 0.46% increase in total power. Moreover, our peak power driven voltage partitioning algorithm is integrated into a simulated annealing based floorplanning technique. Experimental results demonstrate that compared to total power driven floorplanning, the peak power driven floorplanning can significantly reduce peak power with only little impact in total power, HPWL, estimated power ground routing cost, level shifter cost and runtime. Further, when the voltage island shutdown is performed, peak power driven voltage partitioning can lead to over 10% more energy saving than a greedy frequency based voltage partitioning when multiple idle block sequences are considered. © 2011 IEEE.-
dc.languageeng-
dc.relation.ispartofIEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD-
dc.subjectFully Polynomial Time Approximation Scheme-
dc.subjectNP-Complete-
dc.subjectPeak Power Minimization-
dc.subjectVoltage Island Shutdown-
dc.subjectVoltage Partitioning-
dc.titleThe approximation scheme for peak power driven voltage partitioning-
dc.typeConference_Paper-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1109/ICCAD.2011.6105411-
dc.identifier.scopuseid_2-s2.0-84862928791-
dc.identifier.spage736-
dc.identifier.epage741-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats