计算机应用与软件2017，Vol.34Issue(4)：309-315,7.DOI:10.3969/j.issn.1000-386x.2017.04.053
一种面向网络边缘任务调度问题的多方向粒子群优化算法
A MULTI-DIRECTIONAL PARTICLE SWARM OPTIMIZATION ALGORITHM FOR NETWORK EDGE TASK SCHEDULING
摘要
Abstract
Task scheduling is an important problem in cloud computing and grid computing environments.Existing scheduling algorithms are often only dedicated to minimizing the total execution time of tasks without setting other constraints, making it difficult to optimize multiple performance metrics simultaneously.The proposed multi-directional particle swarm optimization algorithm for network edge task scheduling problem solves the distributed scheduling problem of concurrent tasks in network edge service nodes.The goal of scheduling is to minimize the total time of task completion in the case that the resource cost of task execution less than the threshold.Compared with the existing discrete particle swarm optimization algorithm, this method reduces the total task completion time and resource cost, and achieves a large degree of optimization of its computational complexity in the case of a reasonable preset resource overhead.The simulation results show that compared with the existing discrete particle swarm optimization algorithm, this method can reduce the total task completion time by about 10.52%~13.23% and the resource cost by 10.32% ~13.29%.Meanwhile, the running time of this method is significantly shorter than that of the existing discrete particle swarm optimization algorithm in the case of a reasonable reduction of resource overhead threshold.关键词
任务调度/多方向粒子群优化/最小化完成时间/开销阈值Key words
Task scheduling/Multi-direction particle swarm optimization/Minimal makespan/Overhead threshold分类
信息技术与安全科学引用本文复制引用
乔楠楠,尤佳莉..一种面向网络边缘任务调度问题的多方向粒子群优化算法[J].计算机应用与软件,2017,34(4):309-315,7.基金项目
中国科学院战略先导技术专项基金(XDA06040501). （XDA06040501）
