西安交通大学电子与信息工程学院,西安,710049
网络首发:2010-08-10,
纸质出版:2010
移动端阅览
曹仰杰 1, 钱德沛 1, 2, 等. 一种面向多处理器系统的在线低功耗调度算法[J]. 西安交通大学学报, 2010,44(8):15-19.
An Online Power-Efficient Scheduling Algorithm for Multiprocessor Systems[J]. 2010, 44(8): 15-19.
针对当前多处理器系统中的散热瓶颈问题
基于处理器动态速度调节技术
提出了一种在线低功耗调度算法(PEQUI).PEQUI以动态均衡算法(EQUI)为基础
公平地分配处理器资源
依据处理器功耗与运行速度间存在非线性关系
以正比于系统任务数的方式调节处理器运行速度.与传统低功耗调度算法相比
PEQUI仅基于当前待调度任务的信息进行决策
决策参数少.以能量消耗与任务执行流时间为评价算法性能的指标
利用在线竞争分析方法证明了PEQUI算法与最优离线算法相比可达到常数竞争比(<10).模拟结果表明
PEQUI比最近到达处理器共享算法(LAPS)和恒速EQUI算法能更好地优化系统整体性能和能量消耗.在相同负载情况下
与LAPS相比
PEQUI在降低功耗的同时系统平均运行时间也降低了近7%.
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%.
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.
利用投影时序逻辑的多内核进程调度建模与验证. 西安交通大学学报,2010,44(3):52-57.
基于反馈的片上多处理器系统层次负载平衡算法. 西安交通大学学报,2008,42(2):179-183.
曙光5000A天体大规模数值模拟软件性能测试. 西安交通大学学报,2009,43(10):71-75.
自适应大规模服务器集群监控系统的构建. 西安交通大学学报,2008,42(4):399-403.
0
浏览量
4
下载量
0
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010802024621