The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Penjadualan tugas berkala yang sedar kuasa dalam sistem masa nyata telah dikaji secara meluas untuk menjimatkan tenaga sambil masih memenuhi keperluan prestasi. Banyak kajian terdahulu menggunakan maklumat kebarangkalian kitaran pelaksanaan tugas untuk membantu penjadualan. Walau bagaimanapun, kebanyakan pendekatan ini menggunakan algoritma heuristik untuk mengatasi model CPU realistik dengan frekuensi diskret dan tidak dapat mencapai penyelesaian optimum secara global. Kadangkala mereka menunjukkan hasil yang lebih teruk daripada skim DVS bukan stokastik. Kertas kerja ini membentangkan skema DVS optimum untuk sistem masa nyata berasaskan bingkai di bawah model kuasa realistik di mana pemproses hanya menyediakan bilangan kelajuan yang terhad dan tiada andaian dibuat pada hubungan kuasa/frekuensi. Skim DVS suboptimum juga dibentangkan dalam kertas ini untuk mencari penyelesaian yang cukup hampir kepada penyelesaian optimum dengan hanya perbelanjaan masa polinomial. Keputusan eksperimen menunjukkan bahawa algoritma yang dicadangkan boleh menjimatkan paling banyak 40% lebih tenaga berbanding dengan yang sebelumnya.
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.
Salinan
Dejun QIAN, Zhe ZHANG, Chen HU, Xincun JI, "Energy-Aware Task Scheduling for Real-Time Systems with Discrete Frequencies" in IEICE TRANSACTIONS on Information,
vol. E94-D, no. 4, pp. 822-832, April 2011, doi: 10.1587/transinf.E94.D.822.
Abstract: Power-aware scheduling of periodic tasks in real-time systems has been extensively studied to save energy while still meeting the performance requirement. Many previous studies use the probability information of tasks' execution cycles to assist the scheduling. However, most of these approaches adopt heuristic algorithms to cope with realistic CPU models with discrete frequencies and cannot achieve the globally optimal solution. Sometimes they even show worse results than non-stochastic DVS schemes. This paper presents an optimal DVS scheme for frame-based real-time systems under realistic power models in which the processor provides only a limited number of speeds and no assumption is made on power/frequency relation. A suboptimal DVS scheme is also presented in this paper to work out a solution near enough to the optimal one with only polynomial time expense. Experiment results show that the proposed algorithm can save at most 40% more energy compared with previous ones.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E94.D.822/_p
Salinan
@ARTICLE{e94-d_4_822,
author={Dejun QIAN, Zhe ZHANG, Chen HU, Xincun JI, },
journal={IEICE TRANSACTIONS on Information},
title={Energy-Aware Task Scheduling for Real-Time Systems with Discrete Frequencies},
year={2011},
volume={E94-D},
number={4},
pages={822-832},
abstract={Power-aware scheduling of periodic tasks in real-time systems has been extensively studied to save energy while still meeting the performance requirement. Many previous studies use the probability information of tasks' execution cycles to assist the scheduling. However, most of these approaches adopt heuristic algorithms to cope with realistic CPU models with discrete frequencies and cannot achieve the globally optimal solution. Sometimes they even show worse results than non-stochastic DVS schemes. This paper presents an optimal DVS scheme for frame-based real-time systems under realistic power models in which the processor provides only a limited number of speeds and no assumption is made on power/frequency relation. A suboptimal DVS scheme is also presented in this paper to work out a solution near enough to the optimal one with only polynomial time expense. Experiment results show that the proposed algorithm can save at most 40% more energy compared with previous ones.},
keywords={},
doi={10.1587/transinf.E94.D.822},
ISSN={1745-1361},
month={April},}
Salinan
TY - JOUR
TI - Energy-Aware Task Scheduling for Real-Time Systems with Discrete Frequencies
T2 - IEICE TRANSACTIONS on Information
SP - 822
EP - 832
AU - Dejun QIAN
AU - Zhe ZHANG
AU - Chen HU
AU - Xincun JI
PY - 2011
DO - 10.1587/transinf.E94.D.822
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E94-D
IS - 4
JA - IEICE TRANSACTIONS on Information
Y1 - April 2011
AB - Power-aware scheduling of periodic tasks in real-time systems has been extensively studied to save energy while still meeting the performance requirement. Many previous studies use the probability information of tasks' execution cycles to assist the scheduling. However, most of these approaches adopt heuristic algorithms to cope with realistic CPU models with discrete frequencies and cannot achieve the globally optimal solution. Sometimes they even show worse results than non-stochastic DVS schemes. This paper presents an optimal DVS scheme for frame-based real-time systems under realistic power models in which the processor provides only a limited number of speeds and no assumption is made on power/frequency relation. A suboptimal DVS scheme is also presented in this paper to work out a solution near enough to the optimal one with only polynomial time expense. Experiment results show that the proposed algorithm can save at most 40% more energy compared with previous ones.
ER -