首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于剪枝优化的多变邻域节能调度算法
引用本文:仇宾,孙曼曼,崔素丽.基于剪枝优化的多变邻域节能调度算法[J].应用科学学报,2021,40(2):349-360.
作者姓名:仇宾  孙曼曼  崔素丽
作者单位:河北师范大学 民族学院, 河北 石家庄 050091
基金项目:河北省科学发展研究课题(No.20200602007)资助
摘    要:为了提高异构计算机系统中任务调度的节能水平,提出了融合剪枝优化的多变邻域节能调度算法。算法构建处理机约束和时间约束两个邻域结构,借助处理机约束邻域减少冗余处理机量,从而降低整体能耗;利用时间约束邻域有效缩减关键路径长度,实现了任务调度对时间的要求。提出了基于时间和能耗的剪枝优化策略,以提高局部寻优效率。通过仿真实验和实际问题求解对比可知,所提算法在不同问题规模、处理机量和通信比下,都取得了较好的节能效果。

关 键 词:节能任务调度  变邻域结构  处理机约束  时间约束  剪枝优化  
收稿时间:2021-06-10

Energy-Saving Scheduling Algorithm for Multi-Variable Neighborhood Based on Pruning Optimization
QIU Bin,SUN Manman,CUI Suli.Energy-Saving Scheduling Algorithm for Multi-Variable Neighborhood Based on Pruning Optimization[J].Journal of Applied Sciences,2021,40(2):349-360.
Authors:QIU Bin  SUN Manman  CUI Suli
Institution:Nationalities school, HeBei Normal University, Shijiazhuang 050091, Hebei, China
Abstract:In order to improve the energy-saving level of task scheduling in heterogeneous computer systems, a multi-variable neighborhood energy-saving scheduling algorithm fused with pruning optimization is proposed. Processor constraint and time constraint neighborhood structures are constructed in the algorithm. The number of redundant processors is reduced by constraining the neighborhood of processors, thus lowering the overall energy consumption. Pruning optimization is introduced into the time and energy consumption neighborhood to improve the efficiency of local optimization. Simulation results show that the proposed algorithm achieves good energy-saving effect under different problem scales, processor capacity and communication ratio.
Keywords:energy saving task scheduling  variable neighborhood structure  processor constraints  time constraint  pruning optimization  
点击此处可从《应用科学学报》浏览原始摘要信息
点击此处可从《应用科学学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号