基于异构计算系统的任务分配与调度算法  

Task Matching and Scheduling in Heterogeneous Computing System

作　　者：马义忠[1] 张聪[1] 周立文[1] 易纪海[1] 

机构地区：[1]兰州大学信息科学与工程学院,甘肃兰州730000

出　　处：《甘肃科学学报》2005年第3期94-98,共5页Journal of Gansu Sciences

摘　　要：任务分配与调度是异构计算系统(HCS)的核心问题之一.提出了一种对异构计算系统进行任务分配与调度的遗传算法.首先对HCS任务分配调度问题做出定义,然后分别讨论了问题的编码表示,种群初始化,染色体适应度函数设计,内部杂交与迁移遗传算子设计,控制参数自适应,算法的总体框架等.并给出算法的仿真实验结果分析与结论等.Task matching and scheduling is one of the most important problems in HCS （Heterogeneous Computing System）. here, a genetic algorithm for task matching and scheduling in HCS is proposed. First the task matching and scheduling problem for HCS is described. Then the permutation representation, the initialization of population, the design of fitness function, internal crossover and migration operator design, the adaptive control parameter, the structure of the algorithm, are discussed respectively. In the end, the experimental results of algorithm simulation, are presented with analyses and conclusions.

关 键 词：异构计算 任务分配与调度 遗传算法 

分 类 号：TP314[自动化与计算机技术—计算机软件与理论]