Energy-constrained scheduling for weakly-hard real-time tasks on multiprocessors

Abstract

In this paper, we consider energy constrained scheduling for weakly hard real-time constrained tasks running on multiprocessors. Rather than simply saving as much energy as possible, we consider energy as hard constraint under which the system remains functional and delivers an acceptable performance at least during the prescribed mission time. We propose a class of Energy-constrained Multiprocessor Real-Time Scheduling algorithms for (m, k)-firm deadline constrained tasks (EMRTS-MK). We prove that EMRTS-MKs provide assurance in terms of quality of multimedia services under a certain condition. We also evaluate the proposed algorithms in several experiments, which quantitatively show that EMRTS-MKs achieve the aforementioned scheduling objectives. © 2012 Springer Science+Business Media B.V.