Power-aware scheduling algorithms for sporadic tasks in real-time systems

15Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we consider the canonical sporadic task model with the system-wide energy management problem. Our solution uses a generalized power model, in which the static power and the dynamic power are considered. We present a static solution to schedule the sporadic task set, assuming worst-case execution time for each sporadic tasks release, and propose a dynamic solution to reclaim the slacks left by the earlier completion of tasks than their worst-case estimations. The experimental results show that the proposed static algorithm can reduce the energy consumption by 20.63%-89.70% over the EDF* algorithm and the dynamic algorithm consumes 2.06%-24.89% less energy than that of the existing DVS algorithm. © 2013 Elsevier Inc.

Cite

CITATION STYLE

APA

Zhang, Y. W., & Guo, R. F. (2013). Power-aware scheduling algorithms for sporadic tasks in real-time systems. Journal of Systems and Software, 86(10), 2611–2619. https://doi.org/10.1016/j.jss.2013.04.075

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free