Multiprocessor Scheduling Using Parallel Genetic Algorithm
Tasks scheduling is the most challenging problem in the parallel computing. Hence, the inappropriate scheduling will reduce or even abort the utilization of the true potential of the parallelization. Genetic algorithm (GA) has been successfully applied to solve the scheduling problem. The fitness evaluation is the most time consuming GA operation for the CPU time, which affect the GA performance. The proposed synchronous master-slave algorithm outperforms the sequential algorithm in case of complex and high number of generations problem.
Keywords: algorithm; parallel processing; scheduling
Download Full-Text
ABOUT THE AUTHORS
Nourah Al-Angari
received her M.Sc. degree in computer science from King Saud university, Saudi Arabia, in 2012.
Abdullatif Alabdullatif
received his M.Sc. from Edinburgh University, Edinburgh UK,in 2006 and his Ph.D. from Heriot-Watt University, Edinburgh, UK, in 2011.
Nourah Al-Angari
received her M.Sc. degree in computer science from King Saud university, Saudi Arabia, in 2012.
Abdullatif Alabdullatif
received his M.Sc. from Edinburgh University, Edinburgh UK,in 2006 and his Ph.D. from Heriot-Watt University, Edinburgh, UK, in 2011.
