Minimizing energy on homogeneous processors with shared memory (Q5925517)

This paper considers the system-wide energy-efficient task scheduling problem in a system architecture equipped with a multi-core processor and a shared main memory. The focus is on the case when the number of tasks is greater than the number of cores, which has been proved to be NP-hard if the number of cores is at least 2. For the multiple-cores case, based on observation from the single-core case, a polynomial-time approximation algorithm is devised with guaranteed performance.