Speed scaling on parallel processors

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2007, Pages 289-298

  Albers, Susanne ^a   Müller, Fabian ^a   Schmelzer, Swen ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

Approximation algorithms; Energy efficiency; Multiprocessor scheduling; NP completeness; Online algorithms

Indexed keywords

APPROXIMATION ALGORITHMS; ELECTRIC POWER UTILIZATION; ONLINE SYSTEMS; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; PROGRAM PROCESSORS; SCHEDULING;

MULTIPROCESSOR SCHEDULING; NP-COMPLETENESS; ONLINE ALGORITHMS;

PARALLEL PROCESSING SYSTEMS;

EID: 35248838821     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1248377.1248424     Document Type: Conference Paper

References (15)

1. S. Albers and H. Fujiwara. Energy-efficient algorithms for flow time minimization. Proc. 23rd Annual Symposium on Theoretical Aspects of Computer Science (STACS), Springer LNCS 3884, 621-633, 2006.
2. J. Augustine, S. Irani and C. Swamy. Optimal power-down strategies. Proc. 45th Annual IEEE Symposium on Foundations of Computer Science, 530-539, 2004.
3. N. Bansal, T. Kimbrel and K. Pruhs. Dynamic speed scaling to manage energy and temperature. Proc. 45th Annual IEEE Symposium on Foundations of Computer Science, 520-529, 2004.
4. P. Baptiste. Scheduling unit tasks to minimize the number of idle periods: A polynomial time algorithm for offline dynamic power management. Proc. 17th Annual ACM-SIAM Symposium on Discrete Algorithms, 364-367, 2006.
5. L.A. Barroso. The price of performance. ACM Queue, 3(7), September 2005.
6. N. Bansal and K. Pruhs. Speed scaling to manage temperature. Proc. 22nd Annual Symposium on Theoretical Aspects of Computer Science (STACS), Springer LNCS 3404, 460-471, 2005.
7. J.-J. Chen, H.-R. Hsu, K.-H. Chuang, C.-L. Yang, A.-C. Pang and T.-W. Kuo. Multiprocessor energy-efficient scheduling with task migration considerations. Proc. 16th Euromicro Conference of Real-Time Systems, 101-108, 2004.
8. J.-J. Chen, T.-W. Kuo, H.-I. Lu. Power-saving scheduling for weakly dynamic voltage scaling devices. Proc. 9th International Workshop on Algorithms and Data Structures, Springer LNCS 3608, 338-349, 2005.
9. D.S. Hochbaum and D.B. Shmoys. Using dual approximation algorithms for scheduling problems: Theoretical and practical results. Journal of the ACM, 34:144-162, 1987.
10. Intel pressroom, http://www.intel.com/pressroom/kits/teraflops/ or http://download.intel.com/pressroom/kits/Teraflops/ Teraflops_Research_Chip_Overview.pdf
11. S. Irani, S. Shukla and R. Gupta. Algorithms for power savings. Proc. 14th Annual ACM-SIAM Symposium on Discrete Algorithms, 37-46, 2003.
12. K. Pruhs, R. van Stee, P. Uthaisombut. Speed scaling of tasks with precedence constraints. Proc. 3rd International Workshop on Approximation and Online Algorithms (WAOA), Springer LNCS 3879, 307-319, 2005.
13. K. Pruhs, P. Uthaisombut and G. Woeginger. Getting the best response for your erg. Proc. 9th Scandinavian Workshop on Algorithm Theory (SWAT), Springer LNCS 3111, 15-25, 2004.
14. D.D. Sleator und R.E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28:202-208, 1985.
15. F. Yao, A. Demers and S. Shenker. A scheduling model for reduced CPU energy. Proc. 36th Annual Symposium on Foundations of Computer Science, 374-382, 1995.