2011
DOI: 10.1109/tvlsi.2009.2030199
|View full text |Cite
|
Sign up to set email alerts
|

Quasi-Static Voltage Scaling for Energy Minimization With Time Constraints

Abstract: Abstract

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
6
0

Year Published

2012
2012
2024
2024

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 21 publications
(7 citation statements)
references
References 33 publications
0
6
0
Order By: Relevance
“…In recent years, power consumption becomes the critical limitation in an increasing number of applications [1,2,3], and one of the most effective ways to reduce power consumption is lowing the power supply voltage [4,5,6,7]. Hence, voltage scaling technique has been widely adopted in low-power design [8,9,10,11]. Aggressive voltage scaling into the sub-threshold region would provide better energy efficiency.…”
Section: Introductionmentioning
confidence: 99%
“…In recent years, power consumption becomes the critical limitation in an increasing number of applications [1,2,3], and one of the most effective ways to reduce power consumption is lowing the power supply voltage [4,5,6,7]. Hence, voltage scaling technique has been widely adopted in low-power design [8,9,10,11]. Aggressive voltage scaling into the sub-threshold region would provide better energy efficiency.…”
Section: Introductionmentioning
confidence: 99%
“…This gives a grand total of 3072 processing cores in recent GPU chips [1] enforcing energy efficiency as a primary concern. Earlier work has suggested supply voltage overscaling (VOS) [2] to reduce energy consumption. However, reducing the operating voltage of a core beyond a critical point leads to the so-called "path walls" [3].…”
Section: Introductionmentioning
confidence: 99%
“…frequencies are calculated such that they guarantee that tasks will not violate their dead- Quasi−static Alg. proposed in [2] Greedy [4] Task−splitting [5] Greedy [4] Task−splitting [5] Hypothetical ( . It can be shown that running the voltage scaling algorithm for all possible start times t s of a task results in a frequency function f (t s ) that is convex [2].…”
Section: Online Algorithmmentioning
confidence: 99%
“…proposed in [2] Greedy [4] Task−splitting [5] Greedy [4] Task−splitting [5] Hypothetical ( . It can be shown that running the voltage scaling algorithm for all possible start times t s of a task results in a frequency function f (t s ) that is convex [2]. Thus any linear approximation of the frequency will result in frequency values higher or equal to the optimal one, and consequently no deadline will be violated.…”
Section: Online Algorithmmentioning
confidence: 99%