Date Added: May 2011
In heterogeneous computing systems it is crucial to schedule tasks in a manner that exploits the heterogeneity of the resources and applications to optimize systems performance. Moreover, the energy efficiency in these systems is of a great interest due to different concerns such as operational costs and environmental issues associated to carbon emissions. In this paper, the authors present a series of original low complexity energy efficient algorithms for scheduling. The main idea is to map a task to the machine that executes it fastest while the energy consumption is minimum.