期刊名称：International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
印刷版ISSN：2278-1323
出版年度：2012
卷号：1
期号：3
页码：218-221
出版社：Shri Pannalal Research Institute of Technolgy
摘要：In heterogeneous system task scheduling is a critical problem because tasks are distributed in many networks; the scheduling problem is known to be NP-complete. The task scheduling problem is the problem of assigning the tasks in the system in a manner that will optimize the overall performance of the application, while assuring the correctness of the result. In this paper we introduce the compact genetic algorithm (cGA) to solve the task scheduling problem in heterogeneous system. The cGA represent the population as a probability distribution over the set of solution. It processes each gene independently and requires less memory then the simple genetic algorithm. Therefore, it can be used to give a quick estimate of a problems difficulty. The goal of using this technique is use the given resources optimally and assign the task to the resources efficiently. The simulated result, show that compact gen etic algorithm has better then genetic algorithm and cGA only needs a small amount of memory then GA.
