File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Primal dual gives almost optimal energy efficient online algorithms

TitlePrimal dual gives almost optimal energy efficient online algorithms
Authors
Issue Date2014
PublisherSociety for Industrial and Applied Mathematics (SIAM).
Citation
The 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2014), Portland, OR., 5-7 January 2014. In Conference Proceedings, 2014, p. 1123-1140 How to Cite?
AbstractWe consider the problem of online scheduling of jobs on unrelated machines with dynamic speed scaling to minimize the sum of energy and weighted flow time. We give an algorithm with an almost optimal competitive ratio for arbitrary power functions. (No earlier results handled arbitrary power functions for minimizing flow time plus energy with unrelated machines.) For power functions of the form f(s) = s^alpha for some constant alpha > 1, we get a competitive ratio of O(alpha/log(alpha)), improving upon a previous competitive ratio of O(alpha^2) by Anand et al., along with a matching lower bound of . Further, in the resource augmentation model, with a 1+epsilon speed up, we give a O(1/epsilon) competitive algorithm, with essentially the same techniques, improving the bound of O(1/epsilon^2) by Gupta et al. and matching the bound of Anand et al. [3] for the special case of fixed speed unrelated machines. Unlike the previous results most of which used an amortized local competitiveness argument or dual fitting methods, we use a primal-dual method, which is useful not only to analyze the algorithms but also to design the algorithm itself. Copyright © 2014 by the Society for Industrial and Applied Mathematics.
Persistent Identifierhttp://hdl.handle.net/10722/201111
ISBN

 

DC FieldValueLanguage
dc.contributor.authorDevanur, NRen_US
dc.contributor.authorHuang, Zen_US
dc.date.accessioned2014-08-21T07:13:35Z-
dc.date.available2014-08-21T07:13:35Z-
dc.date.issued2014en_US
dc.identifier.citationThe 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2014), Portland, OR., 5-7 January 2014. In Conference Proceedings, 2014, p. 1123-1140en_US
dc.identifier.isbn978-1-611973-38-9-
dc.identifier.urihttp://hdl.handle.net/10722/201111-
dc.description.abstractWe consider the problem of online scheduling of jobs on unrelated machines with dynamic speed scaling to minimize the sum of energy and weighted flow time. We give an algorithm with an almost optimal competitive ratio for arbitrary power functions. (No earlier results handled arbitrary power functions for minimizing flow time plus energy with unrelated machines.) For power functions of the form f(s) = s^alpha for some constant alpha > 1, we get a competitive ratio of O(alpha/log(alpha)), improving upon a previous competitive ratio of O(alpha^2) by Anand et al., along with a matching lower bound of . Further, in the resource augmentation model, with a 1+epsilon speed up, we give a O(1/epsilon) competitive algorithm, with essentially the same techniques, improving the bound of O(1/epsilon^2) by Gupta et al. and matching the bound of Anand et al. [3] for the special case of fixed speed unrelated machines. Unlike the previous results most of which used an amortized local competitiveness argument or dual fitting methods, we use a primal-dual method, which is useful not only to analyze the algorithms but also to design the algorithm itself. Copyright © 2014 by the Society for Industrial and Applied Mathematics.en_US
dc.languageengen_US
dc.publisherSociety for Industrial and Applied Mathematics (SIAM).-
dc.relation.ispartofProceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithmsen_US
dc.titlePrimal dual gives almost optimal energy efficient online algorithmsen_US
dc.typeConference_Paperen_US
dc.identifier.emailHuang, Z: hzhiyi@hku.hken_US
dc.identifier.authorityHuang, Z=rp01804en_US
dc.description.naturelink_to_OA_fulltext-
dc.identifier.doi10.1137/1.9781611973402.83en_US
dc.identifier.scopuseid_2-s2.0-84902108766-
dc.identifier.hkuros234389en_US
dc.identifier.spage1123-
dc.identifier.epage1140-
dc.publisher.placeUnited States-
dc.customcontrol.immutablesml 141016-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats