会议专题

GENETIC ALGORITHM FOR A SPECIAL CLASS OF MULTIPROCESSOR SCHEDULING

The general problem of multiprocessor scheduling can be stated as scheduling a task graph onto a multiprocessor system to minimize the schedule length.In literature, many algorithms have been proposed for the problem, such as the list heuristic, evolutionary algorithm, combine the above two, and so on.But these algorithms not considered part of the tasks needed to be executed on more than one processor simultaneously, so the above algorithms cannot solve or solve not well to this class of scheduling problems.In view of this special class of multiprocessor scheduling, this paper will propose a reasonable genetic algorithm with rational designed encoding and genetic operations.From experiment, we will find the validity of the algorithm proposed in this paper for the multiprocessor scheduling problem in which some tasks need to be executed on more than one processor simultaneously.

Genetic Algorithm Precedence Multiprocessor System execute on more than one processor simultaneously

DAWEI CHU YIZHOU YAN DAN YU SHILONG MA

State Key Laboratory of Software Development Environment,Beihang University,Beijing 100191,China

国际会议

2011 3rd International Conference on Computer Technology and Development(2011第三届计算机技术与发展国际会议 ICCTD2011)

成都

英文

189-195

2011-11-25(万方平台首次上网日期,不代表论文的发表时间)