Approximation algorithm for the temperature-aware scheduling problem

The paper addresses the problem of performance optimization for a set of periodic tasks with discrete voltage/frequency states under thermal constraints. We prove that the problem is NP-hard, and present a pseudo-polynomial optimal algorithm and a fully polynomial time approximation technique (FPTAS) for the problem. The FPTAS technique is able to generate… CONTINUE READING

6 Figures & Tables


Citations per Year

157 Citations

Semantic Scholar estimates that this publication has 157 citations based on the available data.

See our FAQ for additional information.