基于双仲裁机制和田口正交法的猫群优化任务调度算法  

Cat Swarm Optimization Task Scheduling Algorithm Based on Double Arbitration Mechanism and Taguchi Orthogonal Method

作　　者：张兴明[1] 殷从月 魏帅[1] 叶盛钊 吕平[1] ZHANG Xingming, YIN Congyue, WEI Shuai ,YE Shengzhao, LU Ping(National Digital Switching System Engineering ＆ Technological Research Center Zhengzhou 450002, China)

机构地区：[1]国家数字交换系统工程技术研究中心,郑州450002

出　　处：《电子与信息学报》2018年第10期2521-2528,共8页Journal of Electronics & Information Technology

基　　金：国家科技重大专项资助项目(2016ZX01012101);国家自然科学基金(61572520;61521003)~~

摘　　要：针对异构计算系统任务调度过程中通信冲突以及算法运行时间的问题,该文提出一种基于双仲裁机制和田口正交法的猫群优化任务调度算法。首先利用双仲裁机制对任务资源进行管理,动态判决任务的分配,有效避免通信冲突,再将田口正交法应用到猫群优化过程的跟踪模式中,降低算法运行时间,提高解的质量。实验结果表明,该算法运行速度明显高于其他算法至少约10%,算法在处理大量任务时的并行化效果最优,在异构环境中也体现出其相当大的优势。To solve communication conflicts and algorithm running time problem in task scheduling process of heterogeneous computing system, a cat swarm optimization task scheduling algorithm is proposed based on double arbitration mechanism and Taguchi orthogonal method. Firstly, the double arbitration mechanism is used to manage the task resources, and the task assignment is dynamically decided to avoid effectively communication conflicts. Then, the Taguchi orthogonal method is applied to the tracking mode of the cat swarm optimization process to reduce the algorithm running time and improve the quality of the solution. Experimental results show that the algorithm runs at a rate of at least about 10% faster than other algorithms. The algorithm performs best in parallelism when dealing with a large number of tasks and has considerable advantages in heterogeneous environments.

关 键 词：异构计算 任务调度 猫群优化 双仲裁 田口正交法 

分 类 号：TP39[自动化与计算机技术—计算机应用技术]