基于并行处理系统的一种新的任务调度算法

A New Task Scheduling Algorithm Based on Parallel Processing Systems

提出了在计算机并行处理系统中的一种新的任务调度算法,该算法利用遗传算法思想对加权最少连接算法的任务调度方案进行了改进,弥补了加权最少连接算法的不足,并增加了动态控制功能,较好地解决了N个处理机的任务分配问题.实验结果表明:改进后的W LCGA算法优于普通遗传算法和加权最少连接算法.

This paper gave a new task scheduling algorithm(WLCGA) in computer parallel processing systems.It used the genetic algorithm to improve the Weighted Least Connection Algorithm(WLCA),overcome the deficiencies in the WLCA algorithms and provides functions of dynamic control so that the distribution problem of N processors effectively is solved.From the experimental result,the improved algorithm is superior to genetic algorithm and simulated annealing.