Abstract

We consider speed scaling problems where the objective is to minimize a linear combination of arbitrary scheduling objective S, and energy E. A natural conjecture is that there is an O(1)-competitive algorithm for S on a fixed speed processor if and only if there is an O(1)-competitive algorithm for S+E on a processor with an arbitrary power function. We give evidence to support this conjecture by providing an O(1)-competitive algorithm for the objective of integer stretch plus energy.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.