Algorithmica (2017) 79:568–597
Efﬁcient Computation of Optimal Energy and
Fractional Weighted Flow Trade-Off Schedules
· Neal Barcelo
· Mario Consuegra
· Michael Nugent
· Kirk Pruhs
Received: 3 March 2015 / Accepted: 25 August 2016 / Published online: 31 August 2016
© Springer Science+Business Media New York 2016
Abstract We give a polynomial time algorithm to compute an optimal energy and
fractional weighted ﬂow 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.
Keywords Scheduling · Flow time · Energy efﬁciency · Speed scaling ·
A preliminary version of this work appeared in the Proceedings of the 31st Symposium on Theoretical
Aspects of Computer Science (STACS), 2014 (see ).
M. Consuegra: Work done while at Florida International University.
Max-Planck Institut für Informatik, Saarbrücken, Germany
Department of Computer Science, University of Pittsburgh, Pittsburgh, PA, USA
Google, Seattle, WA, USA
School of Computing Science, Simon Fraser University, Burnaby, BC, Canada
Department of Computer Science, University of Houston, Houston, TX, USA