LIPIcs.STACS.2014.63.pdf
- Filesize: 0.65 MB
- 12 pages
We give a polynomial time algorithm to compute an optimal energy and fractional weighted flow trade-off schedule for a speed-scalable processor with discrete speeds. Our algorithm uses a geometric approach that is based on structural properties obtained from a primal-dual formulation of the problem.
Feedback for Dagstuhl Publishing