Abstract | ||
---|---|---|
This article examines dynamic energy consumption caused by data during software execution on deeply embedded microprocessors, which can be significant on some devices. In worst-case energy consumption analysis, energy models are used to find the most costly execution path. Taking each instruction’s worst-case energy produces a safe but overly pessimistic upper bound. Algorithms for safe and tight bounds would be desirable. We show that finding exact worst-case energy is NP-hard, and that tight bounds cannot be approximated with guaranteed safety. We conclude that any energy model targeting tightness must either sacrifice safety or accept overapproximation proportional to data-dependent energy.
|
Year | Venue | Keywords |
---|---|---|
2018 | ACM Trans. Embedded Comput. Syst. | Energy transparency, complexity, worst case energy consumption |
Field | DocType | Volume |
Mathematical optimization,Software execution,Upper and lower bounds,Computer science,Parallel computing,Dynamic energy,Energy consumption | Journal | 17 |
Issue | Citations | PageRank |
3 | 0 | 0.34 |
References | Authors | |
25 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Jeremy Morse | 1 | 80 | 7.10 |
Steve Kerrison | 2 | 127 | 8.50 |
Kerstin Eder | 3 | 232 | 26.56 |