Susanne Albers
Skip Abstract Section
Abstract
Algorithmic solutions can help reduce energy consumption in computing environs.
- http://www.microsoft.com/whdc/system/pnppwr/powermgmt/default.mspxGoogle Scholar
- Albers, S., Fujiwara, H. Energy-efficient algorithms for flow time minimization. ACM Trans. Algorithms 3 (2007). Google ScholarDigital Library
- 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. Google ScholarDigital Library
- Ambühl, C. An optimal bound for the MST algorithm to compute energy efficient broadcast trees in wireless networks. In Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (2005), Springer LNCS 3580, 1139--1150. Google ScholarDigital Library
- Augustine, J., Irani, S., Swamy, C. Optimal power-down strategies. SIAM J. Comput. 37 (2008), 1499--1516. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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). Google ScholarDigital Library
- Bansal, N., Kimbrel, T., Pruhs, K. Speed scaling to manage energy and temperature. J. ACM 54 (2007). Google ScholarDigital Library
- Bansal, N., Pruhs, K., Stein, C. Speed scaling for weighted flow time. In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (2007), 805--813. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- Barroso, L.A. The price of performance. ACM Queue 3 (2005). Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- Bunde, D.P. Power-aware scheduling for makespan and flow. In Proceedings of the 18th Annual ACM Symposiun on Parallel Algorithms and Architectures (2006), 190--196. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- Chan, H.-L., Chan, W.-T., Lam, T.-W., Lee, K.-L., Mak K.-S., Wong P.W.H. Energy efficient online deadline scheduling. In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (2007), 795--804. Google ScholarDigital Library
- Chan, H.-L., Edmonds, J., Lam, T.-W, Lee, L.-K., Marchetti-Spaccamela, A., Pruhs, K. Nonclairvoyant speed scaling for flow and energy. In Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (2009), 255--264.Google Scholar
- 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. Google ScholarDigital Library
- Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C. Introduction to Algorithms, MIT Press and McGraw-Hill, 2001. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- Flammini, M., Klasing, R., Navarra, A., Perennes, S. Improved approximation results for the minimum energy broadcasting problem. Algorithmica 49 (2007), 318--336. Google ScholarDigital Library
- Irani, S., Shukla, S.K., Gupta, R. Algorithms for power savings. ACM Trans. Algorithms 3 (2007). Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- Irani, S., Karlin, A.R. Online computation. In Approximation Algorithms for NP-Hard Problems. Hochbaum D. ed. PWS Publishing Company, 1997, 521--564. Google ScholarDigital Library
- Irani, S., Pruhs, K. Algorithmic problems in power management. SIGACT News 36 (2005), 63--76. Google ScholarDigital Library
- Karlin, A.R., Manasse, M.S., McGeoch, L.A, Owicki, S.S. Competitive randomized algorithms for nonuniform problems. Algorithmica 11 (1994), 542--571.Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- Lam, T.-W., Lee, L.-K., To, I.K.-K., Wong, P.W.H. Competitive non-migratory scheduling for flow time and energy. In Proceedings of the 20th Annual ACM Symposium on Parallel Algorithms and Architectures (2008), 256--264. Google ScholarDigital Library
- Lam, T.-W., Lee, L.-K., To, I.K.-K., Wong, P.W.H. Speed scaling functions for flow time scheduling based on active job count. In Proceedings of the 16th Annual European Symposium on Algorithms (2008), Springer LNCS 5193, 647--659. Google ScholarDigital Library
- Li, M., Liu, B.J., Yao, F.F. Min-energy voltage allocation for tree-structured tasks. J. Comb. Optim. 11 (2006), 305--319.Google ScholarCross Ref
- 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.Google ScholarCross Ref
- Li, M., Yao, F.F. An efficient algorithm for computing optimal discrete voltage schedules. SIAM J. Comput. 35 (2005), 658--671. Google ScholarDigital Library
- Pruhs, K., van Stee, R., Uthaisombut, P. Speed scaling of tasks with precedence constraints. Theory Comput. Syst. 43 (2008), 67--80. Google ScholarDigital Library
- Pruhs, K., Uthaisombut, P., Woeginger, G.J. Getting the best response for your erg. ACM Trans. Algorithms 4 (2008). Google ScholarDigital Library
- Sleator, D.D., Tarjan, R.E. Amortized efficiency of list update and paging rules. Comm. ACM 28 (1985), 202--208. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
Index Terms
- Energy-efficient algorithms
Recommendations
Energy-efficient Algorithms for Ultrascale Systems
The chances to reach Exascale or Ultrascale Computing are strongly connected with the problem of the energy consumption for processing applications. For physical and economical reasons, the energy consumption has to be reduced significantly to make ...
Performance evaluation of energy efficient ethernet
Until very recently, energy efficiency has received little attention in many wired communications environments. For example, in most current Ethernet standards the transmitter and receiver operate at full power even when no data is being sent. However, ...
Comments