Primal dual gives almost optimal energy efficient online algorithms

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2014, Pages 1123-1140

  Devanur, Nikhil R ^a   Huang, Zhiyi ^b  

^a MICROSOFT RESEARCH   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPETITIVE ALGORITHMS; DYNAMIC SPEED SCALING; ON-LINE ALGORITHMS; ONLINE SCHEDULING; OPTIMAL COMPETITIVE RATIOS; PRIMAL-DUAL METHODS; RESOURCE AUGMENTATION; UNRELATED MACHINES;

ENERGY EFFICIENCY;

EID: 84902108766     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973402.83     Document Type: Conference Paper

References (19)

1. Susanne Albers, Energy-efficient algorithms, Communications of the ACM 53 (2010), no. 5, 86-96.
2. Susanne Albers and Hiroshi Fujiwara, Energy-efficient algorithms for flow time minimization, ACM Transactions on Algorithms 3 (2007), no. 4.
3. S. Anand, Naveen Garg, and Amit Kumar, Resource augmentation for weighted flow-time explained by dual fitting, SODA, SIAM, 2012, pp. 1228-1241.
4. Lachlan L.H. Andrew, Adam Wierman, and Ao Tang, Optimal speed scaling under arbitrary power functions, SIGMETRICS Performance Evaluation Review 37 (2009), no. 2, 39-41.
5. Nikhil Bansal, Ho-Leung Chan, Tak-Wah Lam, and Lap-Kei Lee, Scheduling for speed bounded processors, ICALP (1), 2008, pp. 409-420.
6. Nikhil Bansal, Ho-Leung Chan, and Kirk Pruhs, Speed scaling with an arbitrary power function, SODA, SIAM, 2009, pp. 693-701.
7. Nikhil Bansal, Kirk Pruhs, and Clifford Stein, Speed scaling for weighted flow time, SIAM Journal on Computing 39 (2009), no. 4, 1294-1308.
8. Neal Barcelo, Daniel Cole, Dimitrios Letsios, Michael Nugent, and Kirk Pruhs, Optimal energy trade-off schedules, Sustainable Computing: Informatics and Systems (2013).
9. Luiz Andre Barroso, The price of performance, ACM Queue 3 (2005), no. 7, 48-53.
10. Niv Buchbinder and Joseph Naor, The design of competitive online algorithms via a primal-dual approach, Foundations and Trends in Theoretical Computer Science 3 (2009), no. 2-3, 93-263.
11. Jivitej S. Chadha, Naveen Garg, Amit Kumar, and V.N. Muralidhara, A competitive algorithm for minimizing weighted flow time on unrelated machines with speed augmentation, STOC, ACM, 2009, pp. 679-684.
12. Nikhil R. Devanur, Fisher markets and convex programs, (2010), Manuscript, http://research.microsoft.com/en-us/um/people/nikdev/pubs/convex. pdf.
13. Nikhil R. Devanur and Kamal Jain, Online matching with concave returns, STOC, 2012, pp. 137-144.
14. Anapum Gupta, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, and Kirk Pruhs, Scheduling heterogeneous processors isn't as easy as you think, SODA, SIAM, 2012, pp. 1242-1253.
15. Anapum Gupta, Ravishankar Krishnaswamy, and Kirk Pruhs, Scalably scheduling power-heterogeneous processors, ICALP, Springer, 2010, pp. 312-323.
16. Anupam Gupta, Ravishankar Krishnaswamy, and Kirk Pruhs, Online primal-dual for non-linear optimization with applications to speed scaling, Approximation and Online Algorithms, Springer, 2013, pp. 173-186.
17. Tak-Wah Lam, Lap-Kei Lee, Isaac Kar-Keung To, and Prudence W.H. Wong, Speed scaling functions for flow time scheduling based on active job count, ESA, 2008, pp. 647-659.
18. Kim Thang Nguyen, Lagrangian duality in online scheduling with resource augmentation and speed scaling, Proceedings of the 21st European Symposium on Algorithms, Springer, 2013, pp. 755-766.
19. Andrew C.C. Yao, Probabilistic computations: Toward a unified measure of complexity, FOCS, IEEE, 1977, pp. 222-227.