Title: An SRP-based energy-efficient scheduling algorithm for dependent real-time tasks

Authors: Jun Wu; Jun-Xing Wu

Addresses: Department of Computer Science and Information Engineering, National Pingtung Institute of Commerce, No. 51, Minsheng E. Road, 90004 Pingtung, Taiwan ' Department of Computer Science and Information Engineering, National Pingtung Institute of Commerce, No. 51, Minsheng E. Road, 90004 Pingtung, Taiwan

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.

Keywords: real-time systems; embedded systems; dynamic voltage scaling; DVS; energy efficiency; concurrency control; task scheduling; SRP; stack resource policy; blocking time stealing; BTS; processor speed; energy consumption.

DOI: 10.1504/IJES.2014.064999

International Journal of Embedded Systems, 2014 Vol.6 No.4, pp.335 - 350

Received: 10 Sep 2013
Accepted: 02 Feb 2014
Published online: 11 Oct 2014 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article