Research on a Parallel Genetic Algorithm for Tasks Scheduling in SMP System
MA Guang-si · Microelectronics & Computer · 2006
In general the tasks scheduling problem is a NP-hard problem. Based on the algorithms related with multiprocessor scheduling problem, this paper presents a parallelism genetic scheduling algorithm which well-adapted to the SMP system architecture. Simulation results comparing with other two genetic algorithms, both from the Literatures, show that our algorithm produces encouraging results in terms of quality of solutions and execution speed and even has more advantages in convergence.