Multi-objective Workflow Grid Scheduling Based on Discrete Particle Swarm Optimization

  • Ritu Garg
  • Awadhesh Kumar Singh
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7076)

Abstract

Grid computing infrastructure emerged as a next generation of high performance computing by providing availability of vast heterogenous resources. In the dynamic envirnment of grid, a schedling decision is still challenging. In this paper, we present efficient scheduling scheme for workflow grid based on discrete particle swarm optimization. We attempt to create an optimized schedule by considering two conflicting objectives, namely the execution time (makespan) and total cost, for workflow execution. Multiple solutions have been produced using non dominated sort particle swarm optimization (NSPSO) [13]. Moreover, the selection of a solution out of multiple solutions has been left to the user. The effectiveness of the used algorithm is demostrated by comparing it with well known genetic algorithm NSGA-II. Simulation analysis manifests that NSPSO is able to find set of optimal solutions with better convergence and uniform diversity in small computation overhead.

Keywords

Particle Swarm Optimization Pareto Optimal Solution Pareto Optimal Front Discrete Particle Swarm Optimization Conflicting Objective 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abraham, A., Liu, H., Zhang, W., Chang, T.G.: Scheduling Jobs on Computational Grids Using Fuzzy Particle Swarm Algorithm, pp. 500–507. Springer, Heidelberg (2006)Google Scholar
  2. 2.
    Attiya, G., Hamam, Y.: Task allocation for maximizing reliability of distributed systems: A simulated annealing approach. Journal of Parallel and Distributed Computing 66, 1259–1266 (2006)CrossRefMATHGoogle Scholar
  3. 3.
    Braun, T.D., Siegal, H.J., Beck, N.: A comparision of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems. Journal of Parallel and Distributed Computing 61, 810–837 (2001)CrossRefGoogle Scholar
  4. 4.
    Buyya, R., Venugopal, S.: A Gentle Introduction to Grid Computing and Technologies. CSI Communications 29, 9–19 (2005)Google Scholar
  5. 5.
    Buyya, R., Murshed, M.: GridSim: A Toolkit for Modeling and Simulation of Grid Resource Management and Scheduling, vol. 14, pp. 1175–1220 (2002), http://www.buyya.com/gridsim
  6. 6.
    Chen, W.H., Lin, C.S.: A hybrid heuristic to solve a task allocation problem. Computers & Operations Research 27, 287–303 (2000)CrossRefMATHGoogle Scholar
  7. 7.
    Deb, K., Pratap, A., Aggarwal, S., Meyarivan, T.: A Fast Elitist Multi-Objective Genetic Algorithm. In: Deb, K., Rudolph, G., Lutton, E., Merelo, J.J., Schoenauer, M., Schwefel, H.-P., Yao, X. (eds.) PPSN 2000. LNCS, vol. 1917, pp. 849–858. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  8. 8.
    Deb, K., Jain, S.: Running Performance Metrics for Evolutionary Multi-objective Optimization. In: Proceedings of Simulated Evolution and Learning (SEAL 2002), pp. 13–20 (2002)Google Scholar
  9. 9.
    Wieczorek, M., Prodan, R., Fahringer, T.: Scheduling of Scientific Workflows in the ASKALON Grid Environment. SIGMOD 34(3), 56–62 (2005)CrossRefGoogle Scholar
  10. 10.
    Haluk, T., Hariri, S., Wu, M.Y.: Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing. IEEE Transactions on Parallel and Distributed Systems 13, 260–274 (2002)CrossRefGoogle Scholar
  11. 11.
    Izakian, H., Tork Ladani, B., Zamanifar, K., Abraham, A.: A Novel Particle Swarm Optimization Approach for Grid Job Scheduling. In: Prasad, S.K., Routray, S., Khurana, R., Sahni, S. (eds.) ICISTM 2009. CCIS, vol. 31, pp. 100–109. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  12. 12.
    Kennedy, J., Eberhart, R.: Particle Swarm Optimization. In: Proceedings of IEEE International Conference on Neural Networks, vol. 4, pp. 1942–1948 (1995)Google Scholar
  13. 13.
    Li, X.: A Non-dominated Sorting Particle Swarm Optimizer for Multi- objective Optimization. In: Proceeding of Genetic and Evolutionary Computation Conference 2003 (GECCO 20003), Chicago, USA (2003)Google Scholar
  14. 14.
    Ritchie, G., Levine, J.: A fast, effective local search for scheduling independent jobs in heterogeneous computing environments, Technical report, Centre for Intelligent Systems and their Applications, School of Informatics, University of Edinburgh (2003)Google Scholar
  15. 15.
    Subrata, R., Zomaya, Y.A., Landfeldt, B.: Artificial life techniques for load balancing in computational grids. Journal of Computer and System Sciences 73, 1176–1190 (2007)CrossRefMATHGoogle Scholar
  16. 16.
    Tsiakkouri, E., Sakellariou, R., Zhao, H., Dikaiakos, M.D.: Scheduling Workflows with Budget Constraints. In: CoreGRID Integration Workshop Pisa, Italy (2005)Google Scholar
  17. 17.
    Zhao, S.Z., Zhao, P.N.: Two-lbests Based Multi-objective Particle Swarm Optimizer. Engineering Optimization 43, 1–17 (2011)MathSciNetCrossRefGoogle Scholar
  18. 18.
    Coello, C.A.C., Pulido, G., Lechuga, M.: Handling multi-objective with particle swarm optimization. IEEE Trans. Evol. Comput. 8(3), 256–279 (2004)CrossRefGoogle Scholar
  19. 19.
    Praveen, K., Das, S., Welch, S.M.: Multi-Objective Hybrid PSO Using ε-Fuzzy Dominance. In: Proceeding of Genetic and Evolutionary Computation Conference (GECCO 2007), London, UK (2007)Google Scholar
  20. 20.
    Yu, J., Buyya, R.: Scheduling Scientific Workflow Applications with Deadline and Budget constraints using Genetic Algorithms. Scientific Programming Journal 14(1), 217–230 (2006)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Ritu Garg
    • 1
  • Awadhesh Kumar Singh
    • 1
  1. 1.Computer Engineering DepartmentNational Institute of TechnologyKurukshetraIndia

Personalised recommendations