G. Singh and J. Singh (India)
system, Genetic Algorithm, Task Scheduling, Optimization, NP-Complete.
The scheduling problem deals with the optimal assignment of a set of tasks onto parallel system and orders their execution so that the total completion time is minimized. It is well known NP-complete problem. This paper proposes a genetic based approach to schedule parallel tasks on heterogeneous parallel multiprocessor system. The scheduling problem considered in this paper includes - next to search for an optimal mapping of the task and their sequence of execution and also search for an optimal configuration of the parallel system. An approach for the simultaneous optimization of all these three components of scheduling method using improved parallel genetic algorithm is presented and its performance is evaluated in comparison with traditional scheduling methods.
Important Links:
Go Back
