An SRP-based energy-efficient scheduling algorithm for dependent real-time tasks
by Jun Wu; Jun-Xing Wu
International Journal of Embedded Systems (IJES), Vol. 6, No. 4, 2014

Abstract: In this paper, we are interested in the energy-efficient scheduling of dependent real-time tasks which may access multiunit resources. Based on the well-known stack resource policy (SRP), we propose the blocking-time stealing (BTS) algorithm to schedule dynamic-priority and fixed-priority tasks on a non-ideal dynamic voltage scaling (DVS) processor. Under the BTS algorithm, tasks are scheduled to be executed at proper processor speeds which are determined according to the sufficient schedulability conditions of the earliest deadline first (EDF) and the rate monotonic (RM) algorithms. The BTS algorithm measures dynamically the slack between the actual blocking time of a task and its estimated worst-case blocking time. The slack is then exploited to lower the processor speed guaranteeing that the feasibility of tasks is not affected. As a result, the energy consumption can be reduced while satisfying the timing constraints of real-time tasks.

Online publication date: Sat, 11-Oct-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Embedded Systems (IJES):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com