An efficient algorithm for computing optimal discrete voltage schedules (2005)
Cached
Download Links
- [www.cs.cityu.edu.hk]
- [macs.cs.cityu.edu.hk]
- DBLP
Other Repositories/Bibliography
| Venue: | SIAM J. Comput |
| Citations: | 17 - 1 self |
BibTeX
@ARTICLE{Li05anefficient,
author = {Minming Li and Frances and F. Yao},
title = {An efficient algorithm for computing optimal discrete voltage schedules},
journal = {SIAM J. Comput},
year = {2005},
volume = {35},
pages = {658--671}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. We consider the problem of job scheduling on a variable voltage processor with d discrete voltage/speed levels. We give an algorithm which constructs a minimum energy schedule for n jobs in O(dn log n) time. Previous approaches solve this problem by first computing the optimal continuous solution in O(n 3) time and then adjusting the speed to discrete levels. In our approach, the optimal discrete solution is characterized and computed directly from the inputs. We also show that O(n log n) time is required; hence the algorithm is optimal for fixed d.
Citations
| 322 | A scheduling model for reduced cpu energy - Yao, Demers, et al. - 1995 |
| 247 | Voltage scheduling problem for dynamically variable voltage processors - Ishihara, Yasuura - 1998 |
| 72 | Dynamic speed scaling to manage energy and temperature - Bansal, Kimbrel, et al. - 2004 |
| 49 | Optimal voltage allocation techniques for dynamically variable voltage processors - Kwon, Kim - 2003 |
| 26 | Lower bounds for algebraic computation trees with integer inputs - Yao - 1991 |
| 22 | Min-energy voltage allocation for tree-structured tasks - Li, Liu, et al. |
| 20 | On Energy-Optimal Voltage Scheduling for Fixed-Priority Hard RealTime Systems - Yun, Kim |
| 1 | Wireless Intel SpeedStep Power Manager - Optimizing power consumption for the intel PXA27x processor family, Wireless Intel SpeedStep(R) Power Manager White paper - Corporation - 2004 |
