An approximation algorithm for energy-efficient scheduling on a chip multiprocessor

In the recent decade, voltage scaling has become an at-tractive feature for many system component designs. In this paper, we consider energy-efficient real-time task scheduling over a chip multiprocessor architecture. The objective is to schedule a set of frame-based tasks with the minimum energy consumption, where all tasks are ready at time 0 and share a common deadline. We show that such a minimization prob-lem is NP-hard and then propose a 2.371-approximation al-gorithm. The strength of the proposed algorithm was demon-strated by a series of simulations, for which near optimal re-sults were obtained.