A revisit to voltage partitioning problem

Tao Lin, Sheqin Dong, Bei Yu, Song Chen, Satoshi Goto

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

We revisit voltage partitioning problem when the mapped voltages of functional units are predetermined. If energy consumption is estimated by formulation E=CV2, a published work claimed this problem was NP-hard. We clarify that it is polynomial solvable, then propose an optimal algorithm, its time complexity is O(nk+k2d) which is best so far, where n, k, and d are respectively the numbers of functional units, available supply voltages, and voltages employed in the final design. In reality, considering leakage power the energy-voltage curve is not simply monotonically increasing and there is still no optimal polynomal polynomial time algorithm. However, under the assumption that energy-voltage curve is quasiconvex, which is also a good approximation to actual situation, the optimal solution can be got in time O(nk2). Experimental results show that our algorithms are more efficient than previous works.

Original languageEnglish
Title of host publicationProceedings of the ACM Great Lakes Symposium on VLSI, GLSVLSI
Pages115-118
Number of pages4
DOIs
Publication statusPublished - 2010
Event20th Great Lakes Symposium on VLSI, GLSVLSI 2010 - Providence, RI
Duration: 2010 May 162010 May 18

Other

Other20th Great Lakes Symposium on VLSI, GLSVLSI 2010
CityProvidence, RI
Period10/5/1610/5/18

Fingerprint

Electric potential
Polynomials
Computational complexity
Energy utilization

Keywords

  • quasiconvex assumption
  • voltage partition

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Lin, T., Dong, S., Yu, B., Chen, S., & Goto, S. (2010). A revisit to voltage partitioning problem. In Proceedings of the ACM Great Lakes Symposium on VLSI, GLSVLSI (pp. 115-118) https://doi.org/10.1145/1785481.1785509

A revisit to voltage partitioning problem. / Lin, Tao; Dong, Sheqin; Yu, Bei; Chen, Song; Goto, Satoshi.

Proceedings of the ACM Great Lakes Symposium on VLSI, GLSVLSI. 2010. p. 115-118.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Lin, T, Dong, S, Yu, B, Chen, S & Goto, S 2010, A revisit to voltage partitioning problem. in Proceedings of the ACM Great Lakes Symposium on VLSI, GLSVLSI. pp. 115-118, 20th Great Lakes Symposium on VLSI, GLSVLSI 2010, Providence, RI, 10/5/16. https://doi.org/10.1145/1785481.1785509
Lin T, Dong S, Yu B, Chen S, Goto S. A revisit to voltage partitioning problem. In Proceedings of the ACM Great Lakes Symposium on VLSI, GLSVLSI. 2010. p. 115-118 https://doi.org/10.1145/1785481.1785509
Lin, Tao ; Dong, Sheqin ; Yu, Bei ; Chen, Song ; Goto, Satoshi. / A revisit to voltage partitioning problem. Proceedings of the ACM Great Lakes Symposium on VLSI, GLSVLSI. 2010. pp. 115-118
@inproceedings{6b2e1819a52d4ccc87c22b03f5904b8f,
title = "A revisit to voltage partitioning problem",
abstract = "We revisit voltage partitioning problem when the mapped voltages of functional units are predetermined. If energy consumption is estimated by formulation E=CV2, a published work claimed this problem was NP-hard. We clarify that it is polynomial solvable, then propose an optimal algorithm, its time complexity is O(nk+k2d) which is best so far, where n, k, and d are respectively the numbers of functional units, available supply voltages, and voltages employed in the final design. In reality, considering leakage power the energy-voltage curve is not simply monotonically increasing and there is still no optimal polynomal polynomial time algorithm. However, under the assumption that energy-voltage curve is quasiconvex, which is also a good approximation to actual situation, the optimal solution can be got in time O(nk2). Experimental results show that our algorithms are more efficient than previous works.",
keywords = "quasiconvex assumption, voltage partition",
author = "Tao Lin and Sheqin Dong and Bei Yu and Song Chen and Satoshi Goto",
year = "2010",
doi = "10.1145/1785481.1785509",
language = "English",
isbn = "9781450300124",
pages = "115--118",
booktitle = "Proceedings of the ACM Great Lakes Symposium on VLSI, GLSVLSI",

}

TY - GEN

T1 - A revisit to voltage partitioning problem

AU - Lin, Tao

AU - Dong, Sheqin

AU - Yu, Bei

AU - Chen, Song

AU - Goto, Satoshi

PY - 2010

Y1 - 2010

N2 - We revisit voltage partitioning problem when the mapped voltages of functional units are predetermined. If energy consumption is estimated by formulation E=CV2, a published work claimed this problem was NP-hard. We clarify that it is polynomial solvable, then propose an optimal algorithm, its time complexity is O(nk+k2d) which is best so far, where n, k, and d are respectively the numbers of functional units, available supply voltages, and voltages employed in the final design. In reality, considering leakage power the energy-voltage curve is not simply monotonically increasing and there is still no optimal polynomal polynomial time algorithm. However, under the assumption that energy-voltage curve is quasiconvex, which is also a good approximation to actual situation, the optimal solution can be got in time O(nk2). Experimental results show that our algorithms are more efficient than previous works.

AB - We revisit voltage partitioning problem when the mapped voltages of functional units are predetermined. If energy consumption is estimated by formulation E=CV2, a published work claimed this problem was NP-hard. We clarify that it is polynomial solvable, then propose an optimal algorithm, its time complexity is O(nk+k2d) which is best so far, where n, k, and d are respectively the numbers of functional units, available supply voltages, and voltages employed in the final design. In reality, considering leakage power the energy-voltage curve is not simply monotonically increasing and there is still no optimal polynomal polynomial time algorithm. However, under the assumption that energy-voltage curve is quasiconvex, which is also a good approximation to actual situation, the optimal solution can be got in time O(nk2). Experimental results show that our algorithms are more efficient than previous works.

KW - quasiconvex assumption

KW - voltage partition

UR - http://www.scopus.com/inward/record.url?scp=77954465995&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77954465995&partnerID=8YFLogxK

U2 - 10.1145/1785481.1785509

DO - 10.1145/1785481.1785509

M3 - Conference contribution

SN - 9781450300124

SP - 115

EP - 118

BT - Proceedings of the ACM Great Lakes Symposium on VLSI, GLSVLSI

ER -