Aiming at addressing the bottleneck problem of heat dissipation in multiprocessor systems
an online power-efficient scheduling algorithm PEQUI is proposed based on the dynamic speed scaling technique. PEQUI is capable of fairly allocating processor resources by applying the dynamic partitioning strategy(EQUI). Moreover
PEQUI adjusts processor speeds in proportion to the number of active jobs by taking the non-linear relationship between processor's power consumption and its execution speed into account. Compared with traditional power-efficient algorithms
PEQUI is able to make irrevocable decisions by using only information of the current active jobs
and needs fewer decision-making parameters. Online competitive analysis and a comparison with the optimal offline algorithm show that PEQUI achieves a constant competitive ratio with respect to the total execution time and energy. Simulation results show that PEQUI achieves better performance and lower power consumption than algorithms such as the latest arrival processor sharing(LAPS)and EQUI-based strategies with constant speed. A comparison with LAPS under the same workloads shows that PEQUI effectively reduces power consumption while the execution time reduces near 7%.
关键词
Keywords
references
YAO F, DEMERS A, SHENKER S. A scheduling model for reduced CPU energy[C]∥Proceedings of FOCS. Piscataway, NJ, USA: IEEE, 1995:374-382.
KWON W C, KIM T. Optimal voltage allocation techniques for dynamically variable voltage processors [J]. ACM Transactions on Embedded Computing Systems, 2005, 4(1):211-230.
IRANI S, SHUKLA S, GUPTA R. Algorithms for power savings [J]. ACM Transactions on Algorithms, 2007, 3(4):41-64.
ALBERS S, FUJIWARA H. Energy-efficient algorithms for flow time minimization [J]. ACM Transaction on Algorithms, 2007, 3(4):49-66.
BANSAL N, PRUHS K, STEIN C. Speed scaling for weighted flow time [C]∥Proceedings of SODA. New York, USA: ACM, 2007:805-813.
LAM T W, LEE L K, TO I, et al. Speed scaling functions for flow time scheduling based on active job count [C]∥Proceedings of ESA. Berlin, Germany: Springer, 2008: 647-659.
CHAN Ho-Leung, EDMONDS J, LAM T W, et al. Nonclairvoyant speed scaling for flow and energy [C]∥Proceedings of STACS, Berlin, Germany: Springer, 2009: 409-420.
EDMONDS J. Scheduling in the dark [C]∥Proceedings of STOC. New York, USA: ACM, 1999:179-188.
PRUHS K. Competitive online scheduling for server systems [J]. ACM SIGMETRICS Performance Evaluation Review, 2007, 34(4):52-58.
CAO Yangjie, SUN Hongyang, SHU Wenjing, et al. Malleable-lab: a tool for evaluating adaptive online schedulers on malleable jobs [C]∥Proceedings of PDP. Piscataway, NJ, USA: IEEE, 2010:11-18.
DOWNEY A B. A parallel workload model and its implications for processor allocation [C]∥Proceedings of HPDC. New York, USA: ACM, 1997:112-124.
CIRNE W, BERMAN F. A comprehensive model of the supercomputer workload [C]∥Proceedings of 4th Workshop on Workload Characterization. New York, USA: ACM, 2001: 140-148.