Optimality, fairness, and robustness in speed scaling designs

Performance Evaluation Review

Volumn 38, Issue 1 SPEC. ISSUE, 2010, Pages 37-48

  Andrew, Lachlan L H ^a   Lin, Minghong ^b   Wierman, Adam ^b  

^a SWINBURNE UNIVERSITY OF TECHNOLOGY   (Australia)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMIC SPEED SCALING; ENERGY USE; OPTIMALITY; PROCESSOR SHARING; RESPONSE TIME; SHORTEST REMAINING PROCESSING TIME; SPEED SCALING;

SPEED;

EID: 77954950111     PISSN: 01635999     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1811099.1811044     Document Type: Conference Paper

References (35)

1. S. Albers and H. Fujiwara. Energy-efficient algorithms for flow time minimization. In Lecture Notes in Computer Science (STACS), volume 3884, pages 621-633, 2006.
2. B. Avi-Itzhak, H. Levy, and D. Raz. A resource allocation fairness measure: properties and bounds. Queueing Systems Theory and Applications, 56(2):65-71, 2007.
3. N. Bansal, H.-L. Chan, J. Edmonds, and K. Pruhs. Preprint, 2009. (http://www.cs.pitt.edu/∼kirk/postdoc/spaa.pdf).
4. N. Bansal, H.-L. Chan, T.-W. Lam, and L.-K. Lee. Scheduling for speed bounded processors. In Proc. Int. Colloq. Automata, Languages and Programming, pages 409-420, 2008.
5. N. Bansal, H.-L. Chan, and K. Pruhs. Speed scaling with an arbitrary power function. In Proc. SODA, 2009.
6. N. Bansal, H.-L. Chan, K. Pruhs, and D. Katz. Improved bounds for speed scaling in devices obeying the cube-root rule. In Automata, Lang. Programm., pages 144-155, 2009.
7. N. Bansal, K. Pruhs, and C. Stein. Speed scaling for weighted flow times. In Proc. SODA, pages 805-813, 2007.
8. L. A. Barroso and U. Hölzle. The case for energy- proportional computing. Computer, 40(12):33-37, 2007.
9. N. Bingham, C. Goldie, and J. Teugels. Regular Variation. Cambridge University Press, 1987.
10. J. R. Bradley. Optimal control of a dual service rate M/M/1 production-inventory model. European Journal of Operations Research, 161(3):812-837, 2005.
11. D. P. Bunde. Power-aware scheduling for makespan and flow. In Proc. ACM Symp. Parallel Alg. and Arch., 2006.
12. H.-L. Chan, J. Edmonds, T.-W. Lam, L.-K. Lee, A. Marchetti-Spaccamela, and K. Pruhs. Nonclairvoyant speed scaling for flow and energy. In Proc. STACS, 2009.
13. T. M. Cover and J. A. Thomas. Elements of Information Theory. Wiley, 1991.
14. T. B. Crabill. Optimal control of a service facility with variable exponential service times and constant arrival rate. Management Science, 18(9):560-566, 1972.
15. J. Edmonds. Scheduling in the dark. In Proc. ACM STOC, pages 179-188, 1999.
16. J. M. George and J. M. Harrison. Dynamic control of a queue with adjustable service rate. Oper. Res., 49(5):720-731, 2001.
17. S. V. Hanly. Congestion measures in DS-CDMA networks. IEEE Trans. Commun., 47(3):426-437, Mar. 1999.
18. M. Harchol-Balter, K. Sigman, and A. Wierman. Asymptotic convergence of scheduling policies with respect to slowdown. Perf. Eval., 49(1-4):241-256, Sept. 2002.
19. F. P. Kelly. Reversibility and Stochastic Networks. 1979.
20. A. A. Kherani and R. Nunez-Queija. TCP as an implementation of age-based scheduling: fairness and performance. In IEEE INFOCOM, 2006.
21. L. Kleinrock. Queueing Systems Volume II: Computer Applications. Wiley Interscience, 1976.
22. T.-W. Lam, L.-K. Lee, I. K. K. To, and P. W. H. Wong. Speed scaling functions for flow time scheduling based on active job count. In Proc. Euro. Symp. Alg., 2009.
23. M. Lin, A. Wierman, and B. Zwart. Heavy-traffic analysis of mean response time under shortest remaining processing time. Preprint, 2009.
24. R. Motwani, S. Phillips, and E. Torng. Nonclairvoyant scheduling. Theoret. Comput. Sci., 130(1):17-47, 1994.
25. K. Pruhs, P. Uthaisombut, and G. Woeginger. Getting the best response for your erg. In Scand. Worksh. Alg. Theory, 2004.
26. I. A. Rai, G. Urvoy-Keller, and E. Biersack. Analysis of FB scheduling for job size distributions with high variance. In Proc. of ACM Sigmetrics, 2003.
27. W. Sandmann. A discrimination frequency based queueing fairness measure with regard to job seniority and service requirement. In Proc. of Euro NGI Conf. on Next Generation Int. Nets, 2005.
28. R. E. Tarjan. Amortized computational complexity. SIAM J. Alg. Disc. Meth., 6(2):306-318, 1985.
29. P. Tsiaakis, Y. Yi, M. Chiang, and M. Moonen. Fair greening for DSL broadband access. In GreenMetrics, 2009.
30. R. Weber and S. Stidham. Optimal control of service rates in networks of queues. Adv. Appl. Prob., 19:202-218, 1987.
31. A. Wierman. Fairness and classiffications. Perf. Eval. Rev., 34(4):4-12, 2007.
32. A. Wierman, L. L. H. Andrew, and A. Tang. Power-aware speed scaling in processor sharing systems. In Proc. IEEE INFOCOM, 2009.
33. A. Wierman and M. Harchol-Balter. Classifying scheduling policies with respect to unfairness in an M/GI/1. In Proc. of ACM Sigmetrics, 2003.
34. F. Yao, A. Demers, and S. Shenker. A scheduling model for reduced CPU energy. In Proc. IEEE Symp. Foundations of Computer Science (FOCS), pages 374-382, 1995.
35. S. Zhang and K. S. Catha. Approximation algorithm for the temperature-aware scheduling problem. In Proc. IEEE Int. Conf. Comp. Aided Design, pages 281-288, Nov. 2007.