Energy efficient scheduling via partial shutdown

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2010, Pages 1360-1372

  Khuller, Samir ^a   Li, Jian ^a   Saha, Barna ^a  

^a University of Maryland ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BUDGET CONTROL; COMBINATORIAL OPTIMIZATION; ENERGY EFFICIENCY; POLYNOMIAL APPROXIMATION; SCHEDULING;

ENERGY-EFFICIENT SCHEDULING; GENERALIZED ASSIGNMENT PROBLEM; GREEDY ALGORITHMS; OPTIMAL SOLUTIONS; PARALLEL MACHINE-SCHEDULING PROBLEMS; POLYNOMIAL TIME APPROXIMATION SCHEMES; SCHEDULING MODELS; UNRELATED MACHINES;

CHEMICAL ACTIVATION;

EID: 77951685430     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973075.110     Document Type: Conference Paper

References (23)

1. John Augustine, Sandy Irani, and Chaitanya Swamy. Optimal power-down strategies. SIAM J. Comput, 37(5):1499-1516, 2008.
2. Yossi Azar and Amir Epstein. Convex programming for scheduling unrelated parallel machines. In STOC '05, pages 331-337, 2005. (Pubitemid 43098603)
3. Ken Birman, Gregory Chockler, and Robbert van Renesse. Toward a cloud computing research agenda. SIGACT News, 40(2):68-80, 2009.
4. Julia Chuzhoy and Paolo Codenotti. Resource mini-mization job scheduling. In APPROX, 2009.
5. Julia Chuzhoy, Sudipto Guha, Sanjeev Khanna, and Joseph Naor. Approximation algorithms for the job interval selection problem and related scheduling problems. In FOCS '04: Proceedings of the 45th Symposium on Foundations of Computer Science, pages 81-90, 2004.
6. Julia Chuzhoy and Joseph Naor. New hardness results for congestion minimization and machine scheduling. J. ACM, 53(5):707-721, 2006.
7. Leah Epstein and Jiri Sgall. Approximation schemes for scheduling on uniformly related and identical parallel machines. Algorithmica, 39(1):43-57, 2004.
8. Uriel Feige. A threshold of In n for approximating set cover. Journal of the ACM, 45(4):634-652, 1998.
9. Lisa Fleischer. Maximum generalized flow is submodular. Manuscript, 2009.
10. Rajiv Gandhi, Samir Khuller, Srinivasan Parthasarathy, and Aravind Srinivasan. Dependent rounding in bipartite graphs. In FOCS '02: Proceedings of the 43rd Symposium on Foundations of Computer Science, pages 323-332, 2002.
11. Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, and Danny Segev. Scheduling with outliers. In APPROX, 2009.
12. Dorit Hochbaum and David Shmoys. A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach. SIAM J. on Computing, 17(3):539-551, 1988.
13. Wassily Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58(301): 13-30, 1963.
14. Sandy Irani and Kirk Pruhs. Algorithmic problems in power management. SIGACT News, 36(2):63-76, 2005.
15. Christos Koulamas and George J. Kyparisis. Makespan minimization on uniform parallel machines with release times. European Journal of Operational Research, 157(1):262-266, 2004.
16. V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, and Aravind Srinivasan. Approximation algorithms for scheduling on multiple machines. In FOCS '05, pages 254-263, 2005. (Pubitemid 44375737)
17. Jan Karel Lenstra, David B. Shmoys, and Éva. Tardos. Approximation algorithms for scheduling unrelated parallel machines. Math. Program., 46(3):259-271, 1990.
18. Barna Saha and Aravind Srinivasan. A new approximation technique for resource-allocation problems. Manuscript, 2009.
19. Jeanette P. Schmidt, Alan Siegel, and Aravind Srinivasan. Chernoff-hoeffding bounds for applications with limited independence. SIAM J. Discret. Math., 8(2):223-250, 1995.
20. David B. Shmoys and Éva Tardos. An approximation algorithm for the generalized assignment problem. Math. Program., 62(3):461-474, 1993.
21. Aravind Srinivasan. Improved approximation guarantees for packing and covering integer programs. SIAM J. Comput., 29(2):648-670, 1999.
22. Aravind. Srinivasan. New approaches to covering and packing problems. In Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, pages 567-576, 2001.
23. L.A. Wolsey. An analysis of the greedy algorithm for the submodular set covering problem. Combinatorica, 2:358-393, 1982.