Peripheral-conscious energy-efficient scheduling for weakly hard real-time systems Online publication date: Wed, 03-Dec-2014
by Linwei Niu; Gang Quan
International Journal of Embedded Systems (IJES), Vol. 7, No. 1, 2015
Abstract: In this paper, we study the problem of reducing the energy consumption for a weakly hard real-time system. The weakly hard real-time system is modelled by the (m, k)-constraints, which require that at least m out of any k consecutive jobs of a task meet their deadlines. Since the system energy is consumed not only by the processor alone but also in a large part by other peripheral devices, we first propose a static approach, with the specifications of peripheral devices taken into consideration, to partition the jobs into mandatory/optional jobs to achieve the dual goals of (m, k)-guarantee and overall energy minimisation. Based on that, we present a dynamic scheduling algorithm that adopts preemption control technique and dynamic mandatory/optional partitioning strategy to reduce the energy consumption of the whole system dynamically. Our approach can effectively minimise the system-wide energy consumption and guarantee the (m, k)-deadlines at the same time. The novelty and effectiveness of our techniques are demonstrated through extensive simulation studies.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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:
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
Our Blog 
Follow us on Twitter 
Visit us on Facebook