TASK GRAPH SCHEDULING ON MULTIPROCESSOR BY USING NEW GENETIC ALGORITHM

摘要：

Multiprocessor task scheduling is an important and computationally difficult problem so has known an NPHard problem.Due to the NP-hard nature of the task scheduling problem, there are based on heuristics that try to produce good rather than optimal schedules.A genetic algorithm (GA) is a search heuristic that mimics the process of natural evolution.We design a new encoding mechanism with functional chromosome that uses the priority representation based on random for run tasks in Diagram Acyclic Graph (DAG).It can represent a task schedule efficiently and assign tasks to processors. The proposed priority based GA has show effective performance in various parallel environments for scheduling methods.

关键词： Multiprocessor Task scheduling Genetic algorithm Priority Diagram Acyclic Graph

作者: Mona Bagheri Maryam khademi

作者单位: Department of Computer Engineering Islamic Azad University of South-Tehran Branch -Tehran,Iran Department of Mathematics Islamic Azad University of South-Tehran Branch -Tehran,Iran

会议类型: 国际会议

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

会议地点: 成都

会议语种:英文

页码: 1272-1276

在线出版日期: 2011-11-25（万方平台首次上网日期，不代表论文的发表时间）