QoS constrained grid workflow scheduling optimization based on a novel PSO algorithm

8th International Conference on Grid and Cooperative Computing, GCC 2009

Volumn , Issue , 2009, Pages 153-159

  Tao, Qian ^a   Chang, Huiyou ^a   Yi, Yang ^a   Gu, Chunqin ^a   Yu, Yang ^a  

^a SUN YAT SEN UNIVERSITY   (China)

Author keywords

Double extremums disturbing; Grid workflow; Logistic sequence; Multi QoS; RHDPSO; Scheduling

Indexed keywords

COMPUTATIONAL GRIDS; DATA GRID; DIRECTED ACRYLIC GRAPH; DISCRETE PARTICLE SWARM OPTIMIZATION; DISCRETIZATIONS; EXTREMUMS; FAST CONVERGENCE; GRID ENVIRONMENTS; GRID INFRASTRUCTURES; GRID WORKFLOW; GRID WORKFLOWS; HETEROGENEOUS RESOURCES; HIGH PRECISION; KEY PROBLEMS; LOAD-BALANCING; LOCAL OPTIMA; PARAMETERS OF QUALITY; PREMATURE CONVERGENCE; PSO ALGORITHMS; SERVICE GRIDS; SIMULATION RESULT; TIME SEQUENCES; WORKFLOW SCHEDULING;

ALGORITHMS; COMPUTER SCIENCE; CONSTRAINED OPTIMIZATION; CONVERGENCE OF NUMERICAL METHODS; MANAGEMENT; PARTICLE SWARM OPTIMIZATION (PSO); QUALITY OF SERVICE; SIMULATORS;

GRID COMPUTING;

EID: 72349089532     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GCC.2009.39     Document Type: Conference Paper

References (36)

1. I. Foster and C. Kesselman, The grid: blueprint for a future computing infrastructure. San Mateo, CA: Morgan Kaufmann, 1999.
2. M. Aggarwal, R. D. Kent, and A. Ngom, "Genetic algorithm based scheduler for computational grids," Proc. of the 19th International Symposium on High Performance Computing Systems and Applications (HPCS'05), pp. 209-215, 2005.
3. M. R. Garey and D. S. Johnson, Computers and intractability: a guide to the theory of NP-completeness. New York: Freeman, 1979.
4. R. Buyya, D. Abramson, and J. Giddy and H. Stockinger, "Economic models for resource management and scheduling in grid computing," Concurrency and Computation: Practice and Experience, Vol. 14, pp. 1507-1542, 2002.
5. D. Abramson, R. Buyya, and J. Giddy, "A computational economy for grid computing and its implementation in the nimrod-G resource broker," Future Generation Computer Systems, Vol. 18, No. 8, 2002, pp. 1061-1074.
6. H. Casanova, A. Legrand, D. Zagorodnov, and F. Berman, "Heuristics for scheduling parameter sweep applications in grid environments," Proceedings of the 9th heterogeneous Computing Workshop (HCW'00), pp. 349-363, 2000.
7. X. He, X. Sun, and G. Laszewski, "A QoS guided min-min heuristic for grid task scheduling," Journal of Computer Science and Technology, Vol. 18, No. 4, 2003, pp. 442-451.
8. T. Chen, B. Zhang, X. Hao, and Y. Dai, "Task scheduling in grid based on particle swarm optimization," Proc. of the Fifth International Symposium on High Parallel and Distributed Computing (ISPDC05), pp. 238-245, 2006.
9. L. Zhang, Y. Chen, R. Sun, S. Jing, and B Yang, "A task scheduling algorithm based on PSO for grid computing," International Journal of Computational Intelligence Research, Vol. 4, No. 1, 2008, pp.37-43.
10. Q. Kang, H. He, H. Wang, and C. Jiang, "A novel discrete particle swarm optimization algorithm for job scheduling in grids," Proceedings of the Fourth International Conference on Natural Computation (ICNC'08), pp. 401-405, 2008.
11. A. Abraham, H. Liu, W. Zhang, and T. Chang, "Scheduling jobs on computational grids using fuzzy particle swarm algorithm," Lecture Notes in Computer Science, Vol. 4252, 2006, pp. 500-507.
12. X. Zhang, X. Li, Q. Wang, and Y. Yuan, "Hybrid particle swarm optimization algorithm for cost minimization in service-workflows with due dates," Journal on Communications, Vol. 29, No.8, 2008, pp. 87-93. (in Chinese).
13. Y. Wang, C. Hu, and Z. Du, "QoS-wared grid workflow schedule," Journal of Software, Vol. 17, No. 11, 2006, pp. 2341-2351. (in Chinese).
14. V. D. Martino and M. Mililotti, "Scheduling in a grid computing environment using genetic algorithms," Proceedings of International Parallel and Distributed Processing Symposium (IPDPS'02), pp. 235-239, 2002.
15. Y. Gao, H. Rong, and J. Z. Huang, "Adaptive grid job scheduling with genetic algorithms, Future Generation Computer Systems," Vol. 21, No. 1, 2005, pp.151-161.
16. S. Song, Y. Kwok, and K. Hwang, "Security-driven heuristics and a fast genetic algorithm for trusted grid job scheduling," Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05), 2005.
17. S. Lorpunmanee, M. N. Sap, A. H. Abdullah, and C. Chompoo-inwai, "An ant colony optimization for dynamic job scheduling in grid environment," Proceedings of World Academy of Science, Engineering and Technology, pp.314-321, 2007.
18. W. Chen and J. Zhang, "An ant colony optimization approach to a grid workflow scheduling problem with various QoS requirements," IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews, Vol. 39, No. 1, 2009, pp. 29-43
19. I Foster, C. Kesselman, J. M. Nick, and S. Tuecke, "Grid service for distributed system integration," IEEE Computer, Vol. 35, No. 6, 2002, pp. 37-46.
20. A. Afzal, J. Darlington, and A. S. Mcgough, "QoS-constrained stochastic workflow scheduling in enterprise and scientific grids," Proc. of the 7th International Conference on Grid Computing, pp.1-8, 2006.
21. J. Yu, R. Buyya, and C. K. Tham, "QoS-based scheduling of workflow applications on service grids," Proceedings of the 1st IEEE International Conference o e-Science and Grid Computing, 2005.
22. D. Kyriazis, K. Tserpes, A. Menychtas, A. Litke, and T. Varvarigou, "An innovative workflow mapping mechanism for grids in the frame of quality of service," Future Generation Computer System, Vol.24, No. 6, 2008, pp. 498-511.
23. J. Kennedy and R. Eberhart, "Particle swarm optimization," Proceedings of the IEEE International Conference on Neural Networks, Vol. 4, pp. 1942-1948, 1995.
24. J. Kennedy and R. Eberhart, "A discrete binary version of the particle swarm algorithm," Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, Vol. 5, pp. 4104-4108, 1997.
25. Q. Pan, M. F. Tasgetiren, and Y. Liang, "A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem," Computers & Operations Research, Vol. 35, No. 9, 2008, pp. 2807-2839.
26. C. Liao, C. Tseng, and P. Luarn, "A discrete version of particle swarm optimization for flowshop scheduling problems," Computers & Operations Research, Vol. 34, No. 10, 2007, pp. 3099-3111.
27. M. R. AlRashidi, and M. E. El-Hawary, "Hybrid particle swarm optimization approach for solving the discrete OPF problem considering the valve loading effects," IEEE Transactions on Power Systems, Vol. 22, No. 4, 2007, pp.2030-2038.
28. J. Wu, J. Zhu, G. Chen, and H. Zhang, "Hybrid method for optimal scheduling of short-term electric power generation of cascaded hydroelectric plants based on particle swarm optimization and chance-constrained programming," IEEE Transactions on Power Systems, Vol. 23, No. 4, 2008, pp. 1570-1579.
29. S. NemaA, J. Goulermas, G. Sparrow, and P. Cook, "Hybrid particle swarm branch-and-bound (HPB) optimizer for mixed discrete nonlinear programming." IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans, Vol. 38, No. 6, 2008, pp. 1411-1423.
30. S. L. Ho, S. Yang, G. Ni, E. W. C. Lo, and H. C. Wong, "A particle swarm optimization-based method for multiobjective design optimizations," IEEE Transactions on Magnetics, Vol. 41, No. 5, 2005, pp. 1756-1759.
31. J. S. Heo, K. Y. Lee, and R. Garduno-Ramirez, "Multiobjective control of power plant using particle swarm optimization techniques," IEEE Transactions on Energy Conversion, vol. 21, No. 2, 2006, pp. 552-561.
32. D. Liu, K. C. Tan, C. K. Goh, and W. K. Ho, "A multiobjective memetic algorithm based on particle swarm optimization," IEEE Transactions on Systems, Man and Cybernetics, Part B: Cybernetics, Vol. 37, No. 1, 2007, pp. 42-50.
33. L. Zeng, B. Benatallah, A. H. H. Ngu, M. Dumas, J. Kalagnanam, and H. Chang, "QoS-aware middleware for web services composition," IEEE Transactions on Software Engineering, Vol. 30, No. 5, 2004, pp. 311-327.
34. Y. Lu, S. Li, S. Chen, W. Guo, and C. Zhou, "Particle swarm optimization based on adaptive diffusion and hybrid mutation," Journal of Software, Vol. 18, No. 11, 2007, pp. 2740-2751. (in Chinese).
35. E. Deelman, J. Blythe, Y. Gil, C. Kesselman, G. Mehta, and K. Vahi, et al., "Mapping abstract complex workflows onto grid environments," Journal of grid Computing, Vol. 1, No.1, 2003, pp. 25-39.
36. A. O'Brien, S. Newhouse, and J. Darlington, "Mapping of scientific workflow within the e-protein project to distributed resources," Proc. of the UK e-Science All Hands Meeting 2004, pp. 404-409, 2004.