The paper review presentation of 'GLOA:A New Job Scheduling Algorithm for Grid Computing' published in International Journal of Artificial Intelligence and Interactive Multimedia, Vol. 2, Nº 1.
10. Group Leader
OSLab
• The best member
• Members try to become similar
• Find solution space
• Randomly interchanged some variables
between groups
– Come out of local minima
10
http://www.empiremarketing.ca/reportuploads/1316465877-Leading_by_example_SEO.png
11. Steps
OSLab
• Initial Population Production
– P members * n groups
• Calculating Fitness Values of All group
Members
– Fitness(member_i)=1/makespan(member_i)
• Determine Leader
– The most fitness member
11
13. Steps
OSLab
• Mutation Operator
– new =r1 *old+r2 *leader +r3 *random
– If it is better, replace old
• One-way Crossover Operator
– Some parameters values are replaced with
another values of another group
– To escape local minima
• Repetition
13
16. Conclusion
OSLab
• Purpose of the Grid Computing
– Make Common Resources available to a central
computer
– computational power, bandwidth, and databases
• GLOA
–
–
–
–
scheduling tasks/jobs in a computational grid
wasting less computation time
produce shortest makespans
could be applied in the real world
• Less overhead on resources
16
19. References
OSLab
• Pooranian, Z., M. Shojafar, J. H. Abawajy, and M. Singhal.
GLOA: A New Job Scheduling Algorithm for Grid
Computing. IJIMAI(2013.03), p.59-64
• http://casd.csie.ncku.edu.tw/meeting/n1/20121214/CloudDLS%20Dynamic%20trusted%20scheduling%20for%20Cloud
%20computing.pdf
• http://en.wikipedia.org/wiki/Deterministic_algorithm
• http://en.wikipedia.org/wiki/Simulated_annealing
• http://en.wikipedia.org/wiki/Particle_swarm_optimizationhttp
://www.inf.ucv.cl/~bcrawford/Cuesta_Olivares/NuevasMetahe
uristicas/1-s2.0-S0020025509001200-main.pdf
• http://www.ise.ncsu.edu/fangroup/ie789.dir/IE789F_tabu.pdf
19