Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6885720 | Journal of Systems and Software | 2014 | 10 Pages |
Abstract
In this paper, we consider the generalized power model in which the focus is the dynamic power and the static power, and we study the problem of the canonical sporadic task scheduling based on the rate-monotonic (RM) scheme. Moreover, we combine with the dynamic voltage scaling (DVS) and dynamic power management (DPM). We present a static low power sporadic tasks scheduling algorithm (SSTLPSA), assuming that each task presents its worst-case work-load to the processor at every instance. In addition, a more energy efficient approach called a dynamic low power sporadic tasks scheduling algorithm (DSTLPSA) is proposed, based on reclaiming the dynamic slack and adjusting the speed of other tasks on-the-fly in order to reduce energy consumption while still meeting the deadlines. The experimental results show that the SSTLPSA algorithm consumes 26.55-38.67% less energy than that of the RM algorithm and the DSTLPSA algorithm reduces the energy consumption up to 18.38-30.51% over the existing DVS algorithm.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Networks and Communications
Authors
Yi-wen Zhang, Rui-feng Guo,