The principles for good design of battery-aware voltage scheduling algorithms for both aperiodic and periodic task sets on dynamic voltage scaling (DVS) systems are presented. The proposed algorithms are based on greedy heuristics suggested by several battery characteristics and Lagrange multipliers. To construct the proposed algorithms, we use the battery characteristics in the early stage of scheduling more properly. As a consequence, the proposed algorithms show superior results on synthetic examples of periodic and aperiodic tasks from the task sets which are excerpted from the comparative work, on uni- and multi-processor platforms, respectively. In particular, for some large task sets, the proposed algorithms enable previously unschedulable task sets due to battery exhaustion to be schedulable.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Tetsuo YOKOYAMA, Gang ZENG, Hiroyuki TOMIYAMA, Hiroaki TAKADA, "Static Task Scheduling Algorithms Based on Greedy Heuristics for Battery-Powered DVS Systems" in IEICE TRANSACTIONS on Information,
vol. E93-D, no. 10, pp. 2737-2746, October 2010, doi: 10.1587/transinf.E93.D.2737.
Abstract: The principles for good design of battery-aware voltage scheduling algorithms for both aperiodic and periodic task sets on dynamic voltage scaling (DVS) systems are presented. The proposed algorithms are based on greedy heuristics suggested by several battery characteristics and Lagrange multipliers. To construct the proposed algorithms, we use the battery characteristics in the early stage of scheduling more properly. As a consequence, the proposed algorithms show superior results on synthetic examples of periodic and aperiodic tasks from the task sets which are excerpted from the comparative work, on uni- and multi-processor platforms, respectively. In particular, for some large task sets, the proposed algorithms enable previously unschedulable task sets due to battery exhaustion to be schedulable.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E93.D.2737/_p
Copy
@ARTICLE{e93-d_10_2737,
author={Tetsuo YOKOYAMA, Gang ZENG, Hiroyuki TOMIYAMA, Hiroaki TAKADA, },
journal={IEICE TRANSACTIONS on Information},
title={Static Task Scheduling Algorithms Based on Greedy Heuristics for Battery-Powered DVS Systems},
year={2010},
volume={E93-D},
number={10},
pages={2737-2746},
abstract={The principles for good design of battery-aware voltage scheduling algorithms for both aperiodic and periodic task sets on dynamic voltage scaling (DVS) systems are presented. The proposed algorithms are based on greedy heuristics suggested by several battery characteristics and Lagrange multipliers. To construct the proposed algorithms, we use the battery characteristics in the early stage of scheduling more properly. As a consequence, the proposed algorithms show superior results on synthetic examples of periodic and aperiodic tasks from the task sets which are excerpted from the comparative work, on uni- and multi-processor platforms, respectively. In particular, for some large task sets, the proposed algorithms enable previously unschedulable task sets due to battery exhaustion to be schedulable.},
keywords={},
doi={10.1587/transinf.E93.D.2737},
ISSN={1745-1361},
month={October},}
Copy
TY - JOUR
TI - Static Task Scheduling Algorithms Based on Greedy Heuristics for Battery-Powered DVS Systems
T2 - IEICE TRANSACTIONS on Information
SP - 2737
EP - 2746
AU - Tetsuo YOKOYAMA
AU - Gang ZENG
AU - Hiroyuki TOMIYAMA
AU - Hiroaki TAKADA
PY - 2010
DO - 10.1587/transinf.E93.D.2737
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E93-D
IS - 10
JA - IEICE TRANSACTIONS on Information
Y1 - October 2010
AB - The principles for good design of battery-aware voltage scheduling algorithms for both aperiodic and periodic task sets on dynamic voltage scaling (DVS) systems are presented. The proposed algorithms are based on greedy heuristics suggested by several battery characteristics and Lagrange multipliers. To construct the proposed algorithms, we use the battery characteristics in the early stage of scheduling more properly. As a consequence, the proposed algorithms show superior results on synthetic examples of periodic and aperiodic tasks from the task sets which are excerpted from the comparative work, on uni- and multi-processor platforms, respectively. In particular, for some large task sets, the proposed algorithms enable previously unschedulable task sets due to battery exhaustion to be schedulable.
ER -