Energy-efficient algorithms

Communications of the ACM

Volumn 53, Issue 5, 2010, Pages 86-96

  Albers, Susanne ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC SOLUTIONS; ENERGY CONSUMPTION; ENERGY EFFICIENT;

ALGORITHMS;

EID: 77951770504     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/1735223.1735245     Document Type: Review

References (40)

1. http://www.microsoft.com/whdc/system/pnppwr/powermgmt/default.mspx
2. Albers S. Fujiwara H. energy-effcient algorithms for fow time minimization. ACM TranS. Algorithms 3 (2007).
3. Albers, S., MülLer, F., Schmelzer, S. speed scaling on paralLel processorS. in Proceedings of the 19th ACM Symposium on ParalLelism in Algorithms and Architectures (2007), 289-298.
4. Ambühl, C. an optimal bound for the mst algorithm to compute energy effcient Broadcast trees in wireLess networkS. in Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (2005), springer lncs 3580, 1139-1150.
5. Augustine, J., Irani, S., Swamy, C. optimal power-down strategieS. SIAM J. Comput. 37 (2008), 1499-1516.
6. Bansal, N., Bunde, D.P., Chan, H.-L., Pruhs K. average rate speed scaling. in Proceedings of the 8th Latin American Symposium on Theoretical Informatics (2008), springer lncs 4957, 240-251.
7. Bansal, N., Chan, H.-L., Lam, T.-W., Lee, k.-L. scheduling for speed bounded processorS. in Proceedings of the 35th International Colloquium on Automata, Languages and Programming (2008), springer lncs 5125, 409-420.
8. Bansal, N., Chan, H.-L., Pruhs, K. speed scaling with an arbitrary power function. in Proceedings of the 20th ACM-SIAM Symposium on Discrete Algorithm (2009).
9. Bansal, N., KimBrel, T., Pruhs, K. speed scaling to manage energy and temperaturE. J. ACM 54 (2007).
10. Bansal, N., Pruhs, K., Stein, C. speed scaling for weighted fow timE. in Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (2007), 805-813.
11. Baptiste, P., Chrobak M., Dürr C. Polynomial time algorithms for minimum energy scheduling. in Proceedings of the 15th Annual European Symposium on Algorithms (2007), springer lncs 4698, 136-150.
12. Barroso, L.A. the price of performancE. ACM Queue 3 (2005).
13. Becchetti, L., Korteweg, P., Marchetti-SpaccameLa, A., SkutelLa, M., Stougie, L., VitaLetti, A. Latency constrained aggregation in sensor networks. in Proceedings of the 14th Annual European Symposium on Algorithms (2006), springer lncs 4168, 88-99. (Pubitemid 44699644)
14. Benini, L., Bogliolo, A., De micheli, G. A survey of design techniques for system-Level dynamic power management. IEEE TranS. VLSI Syst. 8 (2000), 299-316.
15. Bunde, D.P. Power-aware scheduling for makespan and fow. in Proceedings of the 18th Annual ACM Symposiun on ParalLel Algorithms and Architectures (2006), 190-196.
16. Caragiannis, I., FLammini, M., Moscardelli, L. an exponential improvement on the mst heuristic for minimum energy Broadcasting in ad hoc wireLess networkS. in Proceedings of the 34th International Colloquium on Automata, Languages and Programming (2007), springer lncs 4596, 447-458.
17. Chan, H.-L., Chan, W.-T., Lam, T.-W., Lee, K.-L., Mak, K.-S., Wong P.W.H. energy effcient online deadline scheduling. in Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (2007), 795-804.
18. Chan, H.-L., Edmonds, J., Lam, T.-W, Lee, L.-k., Marchetti-SpaccameLa, A., Pruhs, K. NoncLairvoyant speed scaling for fow and energy. in Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (2009), 255-264.
19. CLementi, A.E.F., Crescenzi, P., Penna, P., Rossi, G., Vocca, P. on the compLexity of computing minimum energy consumption Broadcast subgraphS. in Proceedings of the 18th International Symposium on Theoretical Aspects of Computer Science (2001), springer 2010, 121-131.
20. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C. Introduction to Algorithms, mit Press and mcgraw-hill, 2001.
21. Demaine, E.D., Ghodsi, M., Hajiaghayi, M.T., Sayedi-Roshkhar, A.S., Zadimoghaddam, M. scheduling to minimize gaps and power consumption. in Proceedings of the 19th Annual ACM Symposium on ParalLel Algorithms and Architectures (2007), 46-54.
22. FLammini, M., KLasing, R., Navarra, A., Perennes, S. improved approximation results for the minimum energy Broadcasting probLem. Algorithmica 49 (2007), 318-336.
23. Irani, S., ShukLa, S.K., Gupta, R. Algorithms for power savingS. ACM TranS. Algorithms 3 (2007).
24. Irani, S., ShukLa, S.K., Gupta, R.K. online strategies for dynamic power management in systems with multipLe power-saving stateS. ACM TranS. Embedded Comput. Syst. 2 (2003), 325-346.
25. Irani, S., Singh, G., ShukLa, S.K., Gupta, R.K. an overview of the competitive and adversarial approaches to designing dynamic power management strategieS. IEEE TranS. VLSI Syst. 13 (2005), 1349-1361.
26. Irani, S., Karlin, A.R. online computation. in Approximation Algorithms for NP-Hard ProbLemS. hochbaum d. ed. PWs Publishing company, 1997, 521-564.
27. Irani, S., Pruhs, K. algorithmic probLems in power management. SIGACT News 36 (2005), 63-76.
28. Karlin, A.R., Manasse, M.S., Mcgeoch, L.A, Owicki, S.S. competitive randomized algorithms for nonuniform probLems. Algorithmica 11 (1994), 542-571.
29. Korteweg, P., Marchetti-SpaccameLa, A., Stougie, L., VitaLetti, A. Data aggregation in sensor networks: baLancing communication and deLay costS. in Proceedings of the 14th International Colloquium on Structural Information and Communication CompLexity (2007), springer lncs 4474, 139-150.
30. Lam, T.-W., Lee, L.-K., To, I.K.-K., Wong, P.W.H. Energy efficient deadline scheduling in two processor systemS. in Proceedings of the 18th International Symposium on Algorithms and Computation (2007), springer lncs 4835, 476-487.
31. Lam, T.-W., Lee, L.-K., To, I.K.-K., Wong, P.W.H. competitive non-migratory scheduling for fow time and energy. in Proceedings of the 20th Annual ACM Symposium on ParalLel Algorithms and Architectures (2008), 256-264.
32. Lam, T.-W., Lee, L.-K., To, I.K.-K., Wong, P.W.H. speed scaling functions for fow time scheduling based on active job count. in Proceedings of the 16th Annual European Symposium on Algorithms (2008), springer lncs 5193, 647-659.
33. Li, M., Liu, B.J., Yao, F.F. min-energy voltage allocation for tree-structured taskS. J. Comb. Optim. 11 (2006), 305-319.
34. Li, M., Yao, A.C., Yao, F.F. discrete and continuous min-energy scheduLes for variabLe voltage processorS. in Proceedings of the National Academy of Sciences USA 103 (2006), 3983-3987.
35. Li, M., Yao, F.F. an effcient algorithm for computing optimal discrete voltage scheduLeS. SIAM J. Comput. 35 (2005), 658-671.
36. Pruhs, K., Van stee, R., Uthaisombut, P. speed scaling of tasks with precedence constraintS. Theory Comput. Syst. 43 (2008), 67-80.
37. Pruhs, K., Uthaisombut, P., Woeginger, G.J. Getting the best response for your erg. ACM TranS. Algorithms 4 (2008).
38. Sleator, D.D., Tarjan, R.E. amortized effciency of list update and paging ruLeS. Comm. ACM 28 (1985), 202-208.
39. Wan, P.-J., Calinescu, G., Li, X.-Y., Frieder, O. Minimum-energy Broadcasting in static ad hoc wireLess networkS. WireLess Netw. 8 (2002), 607-617.
40. Yao, F.F., Demers, A.J., Shenker, S. A scheduling model for reduced cPu energy. in Proceedings of the 36th IEEE Symposium on Foundations of Computer Science (1995), 374-382.