Scheduling algorithm with energy-response trade-off considerations for mixed task sets

Authors:
Chin-Fu Kuo;Lieng-Cheng Chien;Yung-Feng Lu
Affiliations:
National University of Kaohsiung Kaohsiung, Taiwan, ROC;National University of Kaohsiung Kaohsiung, Taiwan, ROC;National Taichung University of Science and Technology Taichung, Taiwan, ROC
Venue:
Proceedings of the 2013 Research in Adaptive and Convergent Systems
Year:
2013

Citing 8
Cited 0

Power conscious fixed priority scheduling for hard real-time systems

Proceedings of the 36th annual ACM/IEEE Design Automation Conference
The impact of battery capacity and memory bandwidth on CPU speed-setting: a case study

ISLPED '99 Proceedings of the 1999 international symposium on Low power electronics and design
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
The Case for Higher-Level Power Management

HOTOS '99 Proceedings of the The Seventh Workshop on Hot Topics in Operating Systems
Synthesis Techniques for Low-Power Hard Real-Time Systems on Variable Voltage Processors

RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Power-Aware Scheduling for Periodic Real-Time Tasks

IEEE Transactions on Computers
Energy - Responsiveness Tradeoffs for Real-Time Systems with Mixed Workload

RTAS '04 Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium
Instruction balance and its relation to program energy consumption

LCPC'01 Proceedings of the 14th international conference on Languages and compilers for parallel computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper aims to investigate the scheduling problem of a mixed task set consisting of periodic tasks and aperiodic jobs in a real-time system. When a mixed task set is executed, a scheduling algorithm has to consider not only the system energy consumption but also the response time of the aperiodic jobs which do not want to be prolonged seriously. This paper proposes the Ratio Reclaim Algorithm (RRA) that reclaims the unused execution time for periodic jobs based on a user-defined ratio. For the convenience of maintaining effectively unused execution time left by early completed jobs, the earliness-queue is presented to reduce the memory space that the earliness-queue occupies. A series of experiments are conducted to evaluate the proposed algorithm. The experimental results demonstrate that the RRA scheme with a suitable user-defined value has a better performance than the compared scheme.