Procrastination for leakage-aware rate-monotonic scheduling on a dynamic voltage scaling processor
Proceedings of the 2006 ACM SIGPLAN/SIGBED conference on Language, compilers, and tool support for embedded systems
Allocation cost minimization for periodic hard real-time tasks in energy-constrained DVS systems
Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design
Optimal service level allocation in environmentally powered embedded systems
Proceedings of the 2009 ACM symposium on Applied Computing
Power management in energy harvesting embedded systems with discrete service levels
Proceedings of the 14th ACM/IEEE international symposium on Low power electronics and design
Journal of Signal Processing Systems
An energy management framework for energy harvesting embedded systems
ACM Journal on Emerging Technologies in Computing Systems (JETC)
Dynamic power management in environmentally powered systems
Proceedings of the 2010 Asia and South Pacific Design Automation Conference
Energy reduction for scheduling a set of multiple feasible interval jobs
Journal of Systems Architecture: the EUROMICRO Journal
Staying-alive path planning with energy optimization for mobile robots
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
This paper is interested in reward maximization of periodic real-time tasks under a given energy constraint, where the reward received depends on how much computation a task runs before its deadline. When voltage scaling could be done at any time, and tasks share the same power consumption function, we propose a greedy algorithm which derives a solution with at least a half of the optimal reward for any input instance. A fully polynomial-time approximation scheme is also proposed by applying the dynamic programming approach so that the ratio of the reward of the derived solution to that of an optimal solution is at least 1-ε under polynomial-time complexity in 1/ε for any 0